No article text was recorded for this version.
non-convex loss robustness
Version 2 of 258 papers82 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Compact Model Parameter Extraction via Derivative-Free Optimization
- Blog: Efficient Algorithms for Non-convex Isotonic Regression through Submodular Optimization
- Blog: Sparse Reject Option Classifier Using Successive Linear Programming
- Blog: Calibration and Consistency of Adversarial Surrogate Losses
- Blog: Non-Convex SGD Learns Halfspaces with Adversarial Label Noise
- Blog: Soft-max boosting
- Blog: On the design of robust classifiers for computer vision
- Blog: Calibrated Surrogate Losses for Adversarially Robust Classification
- Blog: Provable Robustness of Adversarial Training for Learning Halfspaces with Noise
- Blog: Making risk minimization tolerant to label noise
- Blog: t-logistic regression
- Blog: Multi-Class $H$-Consistency Bounds
- Blog: Boosting in the presence of label noise
- Blog: Provable Robustness of Adversarial Training for Learning Halfspaces with Noise
- Blog: Semi-supervised Robust Dictionary Learning via Efficient l-Norms Minimization
- Blog: H-Consistency Bounds for Surrogate Loss Minimizers
- Blog: Towards Consistency in Adversarial Classification
- Blog: On the Design of Loss Functions for Classification: theory, robustness to outliers, and SavageBoost
- Blog: Learning with Non-Convex Truncated Losses by SGD
- Blog: Scalable Robust Matrix Factorization with Nonconvex Loss
- Blog: SGLB: Stochastic Gradient Langevin Boosting
- Blog: A Tunable Loss Function for Binary Classification
- Blog: Towards Calibrated Losses for Adversarial Robust Reject Option Classification
- Blog: Boosting in the presence of outliers: adaptive classification with non-convex loss functions
- Blog: On the Online Frank-Wolfe Algorithms for Convex and Non-convex Optimizations
- Blog: Algorithms for Direct 0-1 Loss Optimization in Binary Classification
- Blog: Variance Reduction for Faster Non-Convex Optimization
- Blog: Bayesian Robust Matrix Factorization for Image and Video Processing
- Blog: Residual Weighted Learning for Estimating Individualized Treatment Rules
- Blog: Active Learning as Non-Convex Optimization
- Blog: Efficient Active Learning Halfspaces with Tsybakov Noise: A Non-convex Optimization Approach
- Blog: Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent
- Blog: Alternating Decision Forests
- Blog: Robust Classification with Adiabatic Quantum Optimization
- Blog: Computing D-Stationary Points of ρ-Margin Loss SVM
- Blog: Robust Dictionary Learning with Capped l1-Norm
- Blog: On Symmetric Losses for Robust Policy Optimization with Noisy Preferences
- Blog: IPBoost - Non-Convex Boosting via Integer Programming
- Blog: Smoothly Giving up: Robustness for Simple Models
- Blog: Variance Reduction for Faster Non-Convex Optimization
- Blog: On Classification-Calibration of Gamma-Phi Losses
- Blog: Minimizing Nonconvex Non-Separable Functions
- Blog: The Adversarial Consistency of Surrogate Risks for Binary Classification
- Blog: Generalization Bounds and Consistency for Latent Structural Probit and Ramp Loss
- Blog: Don’t blame Dataset Shift! Shortcut Learning due to Gradients and Cross Entropy
- Blog: Fusing Individualized Treatment Rules Using Secondary Outcomes
- Blog: Provable Robustness of Adversarial Training for Learning Halfspaces with Noise
- Blog: A Pseudo-Bayesian Algorithm for Robust PCA
- Blog: Tighter Bounds for Structured Estimation
- Blog: On Classification-Calibration of Gamma-Phi Losses
- Blog: Consistent Adversarially Robust Linear Classification: Non-Parametric Setting
- Blog: Attribute Noise Robust Binary Classification (Student Abstract)
- Blog: Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent
- Blog: Non-Convex SGD Learns Halfspaces with Adversarial Label Noise
- Blog: Distributed Learning in Non-Convex Environments—Part I: Agreement at a Linear Rate
- Blog: The Adversarial Consistency of Surrogate Risks for Binary Classification
- Blog: Classification with Rejection Based on Cost-sensitive Classification
- Blog: Robust Bi-Tempered Logistic Loss Based on Bregman Divergences
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_non_convex_loss_robustness_06d62e7c,
title = {non-convex loss robustness},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-convex-loss-robustness/rdr_06d62e7c1645463fadfa230e05a17cab},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_non_convex_loss_robustness_06d62e7c_v2,
title = {non-convex loss robustness},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-convex-loss-robustness/rdr_06d62e7c1645463fadfa230e05a17cab/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}