1-bit matrix completion: PAC-Bayesian analysis of a variational approximation (Q1640399): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the properties of variational approximations of Gibbs posteriors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4907706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical learning theory and stochastic optimization. Ecole d'Eté de Probabilitiés de Saint-Flour XXXI -- 2001. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3623263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix estimation by universal singular value thresholding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Bit matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PAC-Bayesian margin bound for linear classifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bayesian approach for noisy matrix completion: optimal rate under general sampling distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive multinomial matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalized regression, standard errors, and Bayesian Lassos / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth discrimination analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bayesian Lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel stochastic gradient algorithms for large-scale matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PAC-Bayesian Inequalities for Martingales / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical behavior and consistency of classification methods based on convex risk minimization. / rank
 
Normal rank

Latest revision as of 21:50, 15 July 2024

scientific article
Language Label Description Also known as
English
1-bit matrix completion: PAC-Bayesian analysis of a variational approximation
scientific article

    Statements

    1-bit matrix completion: PAC-Bayesian analysis of a variational approximation (English)
    0 references
    0 references
    0 references
    14 June 2018
    0 references
    matrix completion
    0 references
    PAC-Bayesian bounds
    0 references
    variational Bayes
    0 references
    supervised classification
    0 references
    risk convexification
    0 references
    oracle inequalities
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references