scientific article

Mehryar Mohri, Ameet Talwalkar, Afshin Rostamizadeh

Publication date: 23 October 2013

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

regression support vector machines PAC learning machine learning AdaBoost

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (93)

On statistical learning of simplices: unmixing problem revisited ⋮ Generalization bounds for regularized portfolio selection with market side information ⋮ Generalization bounds for non-stationary mixing processes ⋮ Fast rates by transferring from auxiliary hypotheses ⋮ Analysis of the Generalization Error: Empirical Risk Minimization over Deep Artificial Neural Networks Overcomes the Curse of Dimensionality in the Numerical Approximation of Black--Scholes Partial Differential Equations ⋮ Apportioned margin approach for cost sensitive large margin classifiers ⋮ Large margin classification with indefinite similarities ⋮ Particle dual averaging: optimization of mean field neural network with global convergence rate analysis* ⋮ Classification with asymmetric label noise: consistency and maximal denoising ⋮ Optimization conditions and decomposable algorithms for convertible nonconvex optimization ⋮ A mean field game inverse problem ⋮ On the geometry of polytopes generated by heavy-tailed random vectors ⋮ Preference relation-based Markov random fields for recommender systems ⋮ Learning finite state models from recurrent neural networks ⋮ \(L_{p}\)-norm Sauer-Shelah lemma for margin multi-category classifiers ⋮ \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? ⋮ Using pseudometrics in kernel density estimation ⋮ Regularizing conjunctive features for classification ⋮ Quantum-based feature selection for multiclassification problem in complex systems with edge computing ⋮ Parallel distributed block coordinate descent methods based on pairwise comparison oracle ⋮ Learning Weighted Automata ⋮ Handling concept drift via model reuse ⋮ Indefinite least squares with a quadratic constraint ⋮ Switching: understanding the class-reversed sampling in tail sample memorization ⋮ Interpolation consistency training for semi-supervised learning ⋮ Accelerating block coordinate descent methods with identification strategies ⋮ A remark about a learning risk lower bound ⋮ Sign stochastic gradient descents without bounded gradient assumption for the finite sum minimization ⋮ Polynomial‐time universality and limitations of deep learning ⋮ A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs ⋮ Regrets of proximal method of multipliers for online non-convex optimization with long term constraints ⋮ On general matrix exponential discriminant analysis methods for high dimensionality reduction ⋮ Partial identification in nonseparable binary response models with endogenous regressors ⋮ Estimating the clustering coefficient using sample complexity analysis ⋮ Random sections of \(\ell_p\)-ellipsoids, optimal recovery and Gelfand numbers of diagonal operators ⋮ Robust multicategory support matrix machines ⋮ Static feedback design in linear discrete-time control systems based on training examples ⋮ A note on star partial order preservers on the set of all variance-covariance matrices ⋮ TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems ⋮ Fast local reduced basis updates for the efficient reduction of nonlinear systems with hyper-reduction ⋮ Optimal probability aggregation based on generalized Brier scoring ⋮ Generalization bounds for learning weighted automata ⋮ Irregularities of Distributions and Extremal Sets in Combinatorial Complexity Theory ⋮ Effective DNA binding protein prediction by using key features via Chou's general PseAAC ⋮ Theory and Algorithms for Shapelet-Based Multiple-Instance Learning ⋮ An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints ⋮ Structure from Randomness in Halfspace Learning with the Zero-One Loss ⋮ On the Complexity of Learning a Class Ratio from Unlabeled Data ⋮ Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches ⋮ Discriminating Traces with Time ⋮ A reconstruction of object properties with significant uncertainties ⋮ Probabilistic error estimation for non-intrusive reduced models learned from data of systems governed by linear parabolic partial differential equations ⋮ Sparse Deep Neural Networks Using L1,∞-Weight Normalization ⋮ Adaptive Learning Algorithm Convergence in Passive and Reactive Environments ⋮ Unnamed Item ⋮ Robust multicategory support vector machines using difference convex algorithm ⋮ Quantum Relief algorithm ⋮ Topological microstructure analysis using persistence landscapes ⋮ Robust domain adaptation ⋮ (Machine) learning parameter regions ⋮ Topological properties of the set of functions generated by neural networks of fixed size ⋮ Chosen-Ciphertext Security from Subset Sum ⋮ Adaptive metric dimensionality reduction ⋮ Inductive matrix completion with feature selection ⋮ Comments on: Support vector machines maximizing geometric margins for multi-class classification ⋮ Reliable clustering of Bernoulli mixture models ⋮ Adaptive sequential machine learning ⋮ Supervised learning via smoothed Polya trees ⋮ \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost} ⋮ An optimality-argument for equal weighting ⋮ High-dimensional dynamics of generalization error in neural networks ⋮ Learning with Rejection ⋮ On the Rademacher Complexity of Weighted Automata ⋮ Learning with Deep Cascades ⋮ Nuclear discrepancy for single-shot batch active learning ⋮ Geometric insights into support vector machine behavior using the KKT conditions ⋮ Unnamed Item ⋮ Optimality of SVM: novel proofs and tighter bounds ⋮ Information-Theoretic Representation Learning for Positive-Unlabeled Classification ⋮ Classification From Pairwise Similarities/Dissimilarities and Unlabeled Data via Empirical Risk Minimization ⋮ Percolation centrality via Rademacher Complexity ⋮ Dynamics of stochastic gradient descent for two-layer neural networks in the teacher–student setup* ⋮ Blind quantum machine learning based on quantum circuit model ⋮ Global and Local Environment State Information as Neural Network Input by Solving the Battleship Game ⋮ Portfolio selection in non-stationary markets ⋮ Unnamed Item ⋮ Over-the-Air computation for distributed machine learning and consensus in large wireless networks ⋮ Boosting for quantum weak learners ⋮ A quantum interior-point predictor–corrector algorithm for linear programming ⋮ A two-layer classification framework for protein fold recognition ⋮ Gaussian Process Landmarking on Manifolds ⋮ Doubly Robust Crowdsourcing ⋮ Discriminative clustering with representation learning with any ratio of labeled to unlabeled data

This page was built for publication: