Pages that link to "Item:Q4910575"

The following pages link to Agnostic Learning of Monomials by Halfspaces Is Hard (Q4910575):

Displaying 18 items.

• Tikhonov, Ivanov and Morozov regularization for support vector machine learning (Q285946) (← links)
• On the hardness of learning intersections of two halfspaces (Q619909) (← links)
• A Fisher consistent multiclass loss function with variable margin on positive examples (Q887268) (← links)
• Provably training overparameterized neural network classifiers with non-convex constraints (Q2106783) (← links)
• Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
• Robust classification via MOM minimization (Q2203337) (← links)
• Kernel variable selection for multicategory support vector machines (Q2237819) (← links)
• Gaussian bounds for noise correlation of resilient functions (Q2303682) (← links)
• Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
• Regularizing conjunctive features for classification (Q2662672) (← links)
• Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces (Q3189646) (← links)
• The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
• Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization (Q5020852) (← links)
• Three candidate plurality is stablest for small correlations (Q5154790) (← links)
• (Q5171188) (redirect page) (← links)
• (Q5743431) (← links)
• A nonlinear kernel SVM Classifier via \(L_{0/1}\) soft-margin loss with classification performance (Q6073171) (← links)
• \(\alpha\)QBoost: an iteratively weighted adiabatic trained classifier (Q6176986) (← links)