Şimşekli et al., 2017 - Google Patents
Parallelized stochastic gradient Markov chain Monte Carlo algorithms for non-negative matrix factorizationŞimşekli et al., 2017
View PDF- Document ID
- 6778875004693762607
- Author
- Şimşekli U
- Durmus A
- Badeau R
- Richard G
- Moulines E
- Cemgil A
- Publication year
- Publication venue
- 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
External Links
Snippet
Stochastic Gradient Markov Chain Monte Carlo (SG-MCMC) methods have become popular in modern data analysis problems due to their computational efficiency. Even though they have proved useful for many statistical models, the application of SG-MCMC to non-negative …
- 239000011159 matrix material 0 title abstract description 18
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
- 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
- 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
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
-
- 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
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
-
- 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/6218—Clustering techniques
- G06K9/622—Non-hierarchical partitioning techniques
- G06K9/6226—Non-hierarchical partitioning techniques based on the modelling of probability density functions
-
- 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
- G06F17/30289—Database design, administration or maintenance
- G06F17/30303—Improving data quality; Data cleansing
-
- 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
- G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
-
- 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
- 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
- G06F17/30587—Details of specialised database models
-
- 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/6296—Graphical models, e.g. Bayesian networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
- G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
- G06F19/24—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology for machine learning, data mining or biostatistics, e.g. pattern finding, knowledge discovery, rule extraction, correlation, clustering or classification
-
- 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
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Lorch et al. | Dibs: Differentiable bayesian structure learning | |
Chen et al. | Projected Stein variational Newton: A fast and scalable Bayesian inference method in high dimensions | |
Vidaurre et al. | A survey of L1 regression | |
Cardot et al. | Efficient and fast estimation of the geometric median in Hilbert spaces with an averaged stochastic gradient algorithm | |
Hsieh et al. | BIG & QUIC: Sparse inverse covariance estimation for a million variables | |
Foti et al. | Stochastic variational inference for hidden Markov models | |
US10776716B2 (en) | Unsupervised learning utilizing sequential output statistics | |
Cappé | Online expectation maximisation | |
Lin et al. | Learning theory of randomized Kaczmarz algorithm | |
Şimşekli et al. | Parallelized stochastic gradient Markov chain Monte Carlo algorithms for non-negative matrix factorization | |
Lee et al. | Bayesian inference on finite mixtures of distributions | |
Shah et al. | An empirical study of stochastic variational inference algorithms for the beta Bernoulli process | |
Siegel et al. | Greedy training algorithms for neural networks and applications to PDEs | |
Gunawan et al. | Fast inference for intractable likelihood problems using variational Bayes | |
Aravkin et al. | Orthogonal matching pursuit for sparse quantile regression | |
Hayashi et al. | A tractable fully bayesian method for the stochastic block model | |
Min et al. | State space partitioning based on constrained spectral clustering for block particle filtering | |
Ronen et al. | A mixing time lower bound for a simplified version of BART | |
Chatla et al. | A tree-based semi-varying coefficient model for the COM-Poisson distribution | |
Xie et al. | Randomized iterative methods for generalized absolute value equations: Solvability and error bounds | |
Chandak et al. | High-confidence off-policy (or counterfactual) variance estimation | |
Yin et al. | Kernel-based approximate Bayesian inference for exponential family random graph models | |
Roig-Solvas et al. | A proximal operator for multispectral phase retrieval problems | |
Sevilla et al. | Estimation of partially known Gaussian graphical models with score-based structural priors | |
Mattila et al. | Asymptotically efficient identification of known-sensor hidden Markov models |