[go: up one dir, main page]

Vono et al., 2022 - Google Patents

Efficient MCMC sampling with dimension-free convergence rate using ADMM-type splitting

Vono et al., 2022

View PDF
Document ID
122037154074905842
Author
Vono M
Paulin D
Doucet A
Publication year
Publication venue
Journal of Machine Learning Research

External Links

Snippet

Performing exact Bayesian inference for complex models is computationally intractable. Markov chain Monte Carlo (MCMC) algorithms can provide reliable approximations of the posterior distribution but are expensive for large data sets and high-dimensional models. A …
Continue reading at www.jmlr.org (PDF) (other versions)

Classifications

    • 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/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression 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/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
    • 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/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/30386—Retrieval requests
    • G06F17/30424—Query processing
    • G06F17/30533—Other types of queries
    • 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
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G06N3/08—Learning methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • 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
    • 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
    • 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

Similar Documents

Publication Publication Date Title
Vono et al. Efficient MCMC sampling with dimension-free convergence rate using ADMM-type splitting
Dai et al. An invitation to sequential Monte Carlo samplers
Lu et al. Accelerating Langevin sampling with birth-death
US8924315B2 (en) Multi-task learning using bayesian model with enforced sparsity and leveraging of task correlations
Buchholz et al. Adaptive tuning of hamiltonian monte carlo within sequential monte carlo
US8983879B2 (en) Systems and methods for large-scale randomized optimization for problems with decomposable loss functions
Yang et al. Weighted SGD for $\ell_p $ Regression with Randomized Preconditioning
Soize et al. Physics‐constrained non‐Gaussian probabilistic learning on manifolds
Ji et al. Understanding estimation and generalization error of generative adversarial networks
Ray et al. Efficient Bayesian shape-restricted function estimation with constrained Gaussian process priors
Chada et al. Unbiased kinetic Langevin Monte Carlo with inexact gradients
Gong et al. Learning distributions over quantum measurement outcomes
De Vito et al. A machine learning approach to optimal Tikhonov regularization I: affine manifolds
Chandra et al. Efficient sampling-based kernel mean matching
Roy Convergence rates for MCMC algorithms for a robust Bayesian binary regression model
Zhang et al. Quantum algorithms and lower bounds for finite-sum optimization
Giles et al. Multilevel monte carlo for scalable bayesian computations
Landgraf Generalized principal component analysis: dimensionality reduction through the projection of natural parameters
Degani et al. Sparse linear mixed model selection via streamlined variational Bayes
Cornacchia et al. Low-dimensional functions are efficiently learnable under randomly biased distributions
Watts et al. Quantum semidefinite programming with thermal pure quantum states
Ceriani et al. Linear-cost unbiased posterior estimates for crossed effects and matrix factorization models via couplings
Feng et al. Over-parameterized deep nonparametric regression for dependent data with its applications to reinforcement learning
He et al. Data augementation with polya inverse gamma
Nilsson et al. Remedi: Corrective transformations for improved neural entropy estimation