Geyer et al., 2020 - Google Patents
Low-rank regularization and solution uniqueness in over-parameterized matrix sensingGeyer et al., 2020
View PDF- Document ID
- 15063392282324821439
- Author
- Geyer K
- Kyrillidis A
- Kalev A
- Publication year
- Publication venue
- International Conference on Artificial Intelligence and Statistics
External Links
Snippet
We consider the question whether algorithmic choices in over-parameterized linear matrix factorization introduce implicit low-rank regularization. We focus on the noiseless matrix sensing scenario over low-rank positive semi-definite (PSD) matrices over the reals, with a …
- 239000011159 matrix material 0 title abstract description 50
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
- G06K9/62—Methods or arrangements for recognition using electronic means
- G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
- G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
- G06K9/6247—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on an approximation criterion, e.g. principal component analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
- G06K9/62—Methods or arrangements for recognition using electronic means
- G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
- G06K9/6261—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation partitioning the feature space
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
- G06K9/62—Methods or arrangements for recognition using electronic means
- G06K9/6267—Classification techniques
- G06K9/6268—Classification techniques relating to the classification paradigm, e.g. parametric or non-parametric approaches
- G06K9/6269—Classification techniques relating to the classification paradigm, e.g. parametric or non-parametric approaches based on the distance between the decision surface and training patterns lying on the boundary of the class cluster, e.g. support vector machines
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N7/00—Computer systems based on specific mathematical models
- G06N7/005—Probabilistic networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Vahdat et al. | Score-based generative modeling in latent space | |
Geyer et al. | Low-rank regularization and solution uniqueness in over-parameterized matrix sensing | |
Tong et al. | Low-rank matrix recovery with scaled subgradient methods: Fast and robust convergence without the condition number | |
d'Aspremont et al. | First-order methods for sparse covariance selection | |
Zhou et al. | Efficient stochastic gradient hard thresholding | |
Gunasekar et al. | Exponential family matrix completion under structural constraints | |
Culp et al. | An iterative algorithm for extending learners to a semi-supervised setting | |
Liu et al. | Multivariate regression with calibration | |
Mueller et al. | Principal differences analysis: Interpretable characterization of differences between distributions | |
Blanchet et al. | Distributionally robust groupwise regularization estimator | |
Park et al. | Finding low-rank solutions to matrix problems, efficiently and provably | |
Tian et al. | Learning from similar linear representations: Adaptivity, minimaxity, and robustness | |
Fang et al. | Max-norm optimization for robust matrix recovery | |
CN102799567A (en) | Information processing apparatus, information processing method, and program | |
Negrinho et al. | Orbit regularization | |
Wang et al. | Localized LQR control with actuator regularization | |
Chen et al. | Conditioning of random feature matrices: Double descent and generalization error | |
Lee et al. | On explicit curvature regularization in deep generative models | |
Fang et al. | Improved Bounded Matrix Completion for Large-Scale Recommender Systems. | |
Sun et al. | An iterative approach to rank minimization problems | |
Dikkala et al. | For manifold learning, deep neural networks can be locality sensitive hash functions | |
Kera et al. | Spurious vanishing problem in approximate vanishing ideal | |
Petersen et al. | Convex regression with interpretable sharp partitions | |
Maurya | A joint convex penalty for inverse covariance matrix estimation | |
Hasanzadeh et al. | Bayesian graph contrastive learning |