{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":44,"n_cols":5,"rows_kept":44,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[14,2,14,3],[15,2,15,3],[19,2,19,3],[19,4,19,5],[20,2,20,3],[20,4,20,5],[21,2,21,3],[21,4,21,5],[22,2,22,3],[23,2,23,3],[24,2,24,3],[25,2,25,3],[26,2,26,3],[28,2,28,3],[38,2,38,3],[39,2,39,3],[41,2,41,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910143913803321"]
[null,null,"Titolo",null,"Federal communications law journal"]
[null,null,"Pubbl/distr/stampa",null,"Los Angeles, : UCLA School of Law and the Federal Communications Bar Association, 1977-"]
[null,null,"ISSN",null,"2376-4457"]
[null,null,"Disciplina",null,"384.02605"]
[null,null,"Soggetti",null,"Telecommunication - Law and legislation - United States"]
[{"$nulls":4},"Communication and traffic - Law and legislation - United States"]
[{"$nulls":4},"Telecommunications - legislation & jurisprudence"]
[{"$nulls":4},"Communication and traffic - Law and legislation"]
[{"$nulls":4},"Telecommunication - Law and legislation"]
[{"$nulls":4},"Journals - full-text"]
[{"$nulls":4},"Law reviews."]
[{"$nulls":4},"Periodicals."]
[{"$nulls":4},"United States"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Periodico"]
[null,null,null,"Note generali","Refereed/Peer-reviewed"]
[{"$nulls":4},"Title from journal title screen (Hein Online, viewed May 25, 2004)."]
[null,"2.","Record Nr.",null,"UNINA9910366589703321"]
[null,null,"Autore",null,"Shi Bin"]
[null,null,"Titolo",null,"Mathematical Theories of Machine Learning - Theory and Applications / / by Bin Shi, S. S. Iyengar"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020"]
[null,null,"ISBN",null,"3-030-17076-4"]
[null,null,"Edizione",null,"[1st ed. 2020.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XXI, 133 p. 25 illus., 24 illus. in color.)"]
[null,null,"Disciplina",null,"621.382"]
[{"$nulls":4},"006.310151"]
[null,null,"Soggetti",null,"Telecommunication"]
[{"$nulls":4},"Computational intelligence"]
[{"$nulls":4},"Data mining"]
[{"$nulls":4},"Information storage and retrieval systems"]
[{"$nulls":4},"Quantitative research"]
[{"$nulls":4},"Communications Engineering, Networks"]
[{"$nulls":4},"Computational Intelligence"]
[{"$nulls":4},"Data Mining and Knowledge Discovery"]
[{"$nulls":4},"Information Storage and Retrieval"]
[{"$nulls":4},"Data Analysis and Big Data"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Chapter 1. Introduction -- Chapter 2. General Framework of Mathematics -- Chapter 3. Problem Formulation -- Chapter 4. Development of Novel Techniques of CoCoSSC Method -- Chapter 5. Further Discussions of the Proposed Method -- Chapter 6. Related Work on Geometry of Non-Convex Programs -- Chapter 7. Gradient Descent Converges to Minimizers -- Chapter 8. A Conservation Law Method Based on Optimization -- Chapter 9. Improved Sample Complexity in Sparse Subspace Clustering with Noisy and Missing Observations -- Chapter 10. Online Discovery for Stable and Grouping Causalities in Multi-Variate Time Series -- Chapter 11. Conclusion."]
[null,null,null,"Sommario/riassunto","This book studies mathematical theories of machine learning. The first part of the book explores the optimality and adaptivity of choosing step sizes of gradient descent for escaping strict saddle points in non-convex optimization problems. In the second part, the authors propose "]
[{"$nulls":4},"algorithms to find local minima in nonconvex optimization and to obtain global minima in some degree from the Newton Second Law without friction. In the third part, the authors study the problem of subspace clustering with noisy and missing data, which is a problem well-motivated by practical applications data subject to stochastic Gaussian noise and/or incomplete data with uniformly missing entries. In the last part, the authors introduce an novel VAR model with Elastic-Net regularization and its equivalent Bayesian model allowing for both a stable sparsity and a group selection. Provides a thorough look into the variety of mathematical theories of machine learning Presented in four parts, allowing for readers to easily navigate the complex theories Includes extensive empirical studies on both the synthetic and real application time series data."]