Compressed classification learning with Markov chain samples
DOI10.1016/J.NEUNET.2013.11.008zbMATH Open1298.68215OpenAlexW2072031809WikidataQ50703943 ScholiaQ50703943MaRDI QIDQ470183FDOQ470183
Authors: Feilong Cao, Tenghui Dai, Yongquan Zhang, Yuanpeng Tan 
Publication date: 12 November 2014
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2013.11.008
Recommendations
- Generalization bounds of compressed regression learning algorithm
- Compressed learning with regular concept
- A compression approach to support vector model selection
- scientific article; zbMATH DE number 1700013
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Compressive sampling
- On the mathematical foundations of learning
- Stable signal recovery from incomplete and inaccurate measurements
- A simple proof of the restricted isometry property for random matrices
- Compressed sensing
- Title not available (Why is that?)
- 10.1162/153244302760200713
- Extensions of compressed sensing
- Best choices for regularization parameters in learning theory: on the bias-variance problem.
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- ONLINE LEARNING WITH MARKOV SAMPLING
- Learning from dependent observations
- Compressed and Privacy-Sensitive Sparse Regression
- The learning performance of support vector machine classification based on Markov sampling
Cited In (3)
This page was built for publication: Compressed classification learning with Markov chain samples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q470183)
