New methods show robustness and accuracy can coexist.
problem Inevitability of robustness-accuracy tradeoff in deep learning.
method Prove robustness and accuracy achievable through locally Lipschitz functions; explore combining dropout with robust training methods.
result Achieving robustness and accuracy requires methods imposing local Lipschitzness and deep learning generalization techniques.
New method certifies global robustness of neural networks efficiently.
problem Adversarial examples threaten certifiably robust neural networks.
method Formalized global robustness, adapted widely-used architectures with efficient global Lipschitz bounds.
result Certifiable robust models achieve state-of-the-art verifiable accuracy with negligible costs.
Validates neural networks inputs to protect against adversarial examples.
problem Ensuring neural networks robustness against adversarial attacks.
method Runtime local robustness verification based on normal distribution of robustness radii.
result Improves neural network accuracy and protects against adversarial examples.
Paper introduces P-sensitive functions and their applications in robust optimization and financial models.
problem Developing robust models for financial and optimization problems under uncertainty.
method Introducing P-sensitive functions and their localization representations, applying to optimization and financial models.
result P-sensitive functions are precisely those that can be localized, providing a new perspective on robust modeling.
In support vector machine (SVM) applications with unreliable data that contains a portion of outliers, non-robustness of SVMs often causes considerable performance deterioration. Although many approaches for improving the robustness of SVMs have been studied, two major challenges remain in robust SVM learning. First, r…
Efficiently checks local robustness in neural networks using geometric projections.
problem Ensuring robustness of neural networks against adversarial inputs.
method Systematic search for decision boundaries in convex polyhedral regions using geometric projections.
result Shows geometric projections can efficiently check robustness in neural networks.
SCORE resolves the robustness vs accuracy trade-off by redefining robust error.
problem The inherent trade-off between robustness and accuracy in adversarial training.
method SCORE defines local equivariance as the ideal robust behavior, leading to a new robust error metric.
result SCORE reconciles robustness and accuracy, improving model performance on RobustBench.
New estimator robust to adversarial noise and data heterogeneity.
problem Sensitive to adversarial noise and poor performance with heterogeneous data.
method Distributionally robust estimator minimizing worst-case conditional expected loss over adversarial distributions.
result Efficiently finds non-parametric local estimates via convex optimization.
Paper proposes a robust LPR method using similarity kernels.
problem Outliers and high-leverage points affect traditional LPR's accuracy.
method Integrates predictor and response variables in weighting mechanism using a conditional density kernel.
result Lower empirical bias compared to iterative robust LOWESS.
New model improves deep learning robustness against adversarial attacks.
problem Improving adversarial robustness of deep learning models.
method Local competition principle, LWTA nonlinearities, Bayesian non-parametrics.
result The new model achieves high robustness to adversarial perturbations on MNIST and CIFAR10 datasets.
We study robust distributed learning that involves minimizing a non-convex loss function with saddle points. We consider the Byzantine setting where some worker machines have abnormal or even arbitrary and adversarial behavior. In this setting, the Byzantine machines may create fake local minima near a saddle point tha…
Unified approach to federated learning improves robustness and personalization.
problem Real-world federated learning challenges like non-IID data and outliers.
method Fed+ methods that unify federated learning algorithms for better robustness and personalization.
result Convergence guarantees for Fed+ on convex and non-convex loss functions under various aggregation methods.
Concept Factorization (CF) and its variants may produce inaccurate representation and clustering results due to the sensitivity to noise, hard constraint on the reconstruction error and pre-obtained approximate similarities. To improve the representation ability, a novel unsupervised Robust Flexible Auto-weighted Local…
MFRDE uses medians of forest estimators to robustly estimate densities in noisy data.
problem Robust density estimation in the presence of outliers.
method MFRDE uses pointwise median operation on forest density estimators fitted on subsampled datasets.
result MFRDE achieves robustness against all outliers while maintaining accuracy for density estimation.
Paper proposes a new method for WDRO with local perturbations, achieving better accuracy.
problem Wasserstein distributionally robust optimization's theoretical understanding needs improvement.
method Develops a new approximation theorem and risk consistency results for WDRO.
result The proposed method achieves significantly higher accuracy on noisy datasets.
LSCI provides locally adaptive prediction sets for operator models with tighter coverage.
problem Generating robust, calibrated uncertainty quantification for operator models.
method Local Sliced Conformal Inference (LSCI) for operator models.
result LSCI yields tighter prediction sets with stronger adaptivity compared to conformal baselines.
New algorithm optimizes robust estimation under mixed local and global corruptions.
problem Combining local and global corruptions in robust statistics.
method Information-theoretic approach using sliced-Wasserstein metric.
result Optimal error achieved in polynomial time for stronger local perturbations.
The huge amount of available data nowadays is a challenge for kernel-based machine learning algorithms like SVMs with respect to runtime and storage capacities. Local approaches might help to relieve these issues and to improve statistical accuracy. It has already been shown that these local approaches are consistent a…
Efficiently certifies global robustness of large neural networks with probabilistic guarantees.
problem Certifying robustness of large neural networks in a scalable and efficient manner.
method Sampling an ε-net and invoking a local robustness oracle.
result Certifies a probabilistic relaxation of robustness efficiently and globally.
DSCF-Net learns deep features for clustering with robustness and locality preservation.
problem Unsupervised deep representation learning for clustering.
method Integrates robust deep concept factorization, deep self-expressive representation, and adaptive locality preserving feature learning.
result Delivers state-of-the-art performance on public databases.
New regularizer for machine learning using private data.
problem Machine learning with private data.
method Distributionally-robust optimization with locally-differentially-private datasets.
result New regularizer for training linear regression models.
Improves deep learning robustness by enforcing local and global compactness.
problem Deep neural networks' vulnerability to adversarial attacks.
method Proposes Adversary Divergence Reduction Network (ADRN) that enforces local/global compactness and clustering assumption.
result Augmenting adversarial training with ADRN components improves robustness.
Improves CNN robustness by reducing texture bias.
problem CNNs' reliance on local texture over global shape.
method Inspired by human vision, InfoDrop decorrelates model output from local texture.
result Enhanced robustness across various scenarios.
A new method simplifies HLLE for better robustness.
problem Improving robustness of Hessian locally linear embedding.
method Replacing Hessian with arbitrary weights and modifying manifold dimension.
result Achieved a new LLE-type method called tangential LLE.
AGNN improves network localization accuracy by 37-53% in NLOS conditions.
problem Massive network localization under Non-Line-of-Sight conditions.
method Attentional Graph Neural Network (AGNN) with Adjacency Learning Module (ALM) and Multiple Graph Attention Layers (MGAL).
result Significant improvement in localization accuracy, approaching fundamental lower bounds.
Study robustness of global feature effect explanations in machine learning models.
problem Vulnerability of global feature effect explanations to data and model perturbations.
method Theoretical bounds and experimental evaluation of partial dependence plots and accumulated local effects.
result Quantifies the gap between best and worst-case scenarios of misinterpreting machine learning predictions globally.
Stochastic LWTA networks resist adversarial attacks while maintaining accuracy.
problem Adversarial robustness of neural networks.
method Replaced ReLU with stochastic LWTA activations, trained with Variational Bayesian and PGD.
result Stochastic LWTA networks achieve state-of-the-art robustness against adversarial attacks.
We propose a general framework for increasing local stability of Artificial Neural Nets (ANNs) using Robust Optimization (RO). We achieve this through an alternating minimization-maximization procedure, in which the loss of the network is minimized over perturbed examples that are generated at each parameter update. We…
DFMR improves robustness of learning finite mixture models in distributed settings.
problem Learning finite mixture models in distributed settings with Byzantine failures.
method DFMR leverages pairwise L2 distances to filter and retain local estimates, ensuring robust aggregation.
result DFMR achieves optimal convergence rate and asymptotic equivalence to global maximum likelihood estimate.
New framework certifies robustness for regression models.
problem Certifying robustness for regression models is challenging.
method Derives a prediction-centered certificate that exploits local geometry.
result Gradient information yields tighter robustness certificates.
The massive amount of available data potentially used to discover patters in machine learning is a challenge for kernel based algorithms with respect to runtime and storage capacities. Local approaches might help to relieve these issues. From a statistical point of view local approaches allow additionally to deal with …
Proposes RLAR for efficient labeled data classification with robust margin and manifold structure.
problem Clear margin representation and data manifold structure difficulty in linear discriminant methods.
method Introduces retargeted regression for adaptive margin learning and locality-aware strategy for compact data manifold.
result RLAR outperforms state-of-the-art approaches in UCI and benchmark data sets.
Paper addresses privacy and robustness in stochastic linear bandits.
problem Stochastic linear bandits with differential privacy and adversarial robustness.
method Logarithmic batch queries, arm elimination algorithm, two privacy models.
result First algorithms providing differential privacy and adversarial robustness.
New knot models analyze local entanglement for robust curve analysis.
problem Lack of local structural information in classical knot theory.
method Proposed multiscale and persistent Jones polynomials.
result Models are stable to small perturbations, robust for real-world applications.
PatchGuard defends against localized adversarial patches with provable robustness.
problem Localized adversarial patches induce misclassification in machine learning models.
method PatchGuard uses CNNs with small receptive fields and robust masking to detect and mask corrupted features.
result PatchGuard achieves state-of-the-art provable robust accuracy and clean accuracy.
This paper introduces SRPR for robust phase retrieval with smoothed loss functions.
problem Robust phase retrieval from noisy quadratic measurements with corruptions.
method Smoothed robust phase retrieval (SRPR) using convolution-type smoothed loss functions.
result SRPR has no spurious local solutions and benign landscape under corruptions.
We present a robust multiple manifolds structure learning (RMMSL) scheme to robustly estimate data structures under the multiple low intrinsic dimensional manifolds assumption. In the local learning stage, RMMSL efficiently estimates local tangent space by weighted low-rank matrix factorization. In the global learning …
New findings show privacy affects generalization error in a non-monotonic way.
problem Privacy and robustness in distributed learning.
method Theoretical analysis and matching lower/upper bounds on algorithmic stability.
result Generalization error is non-monotonically affected by privacy, depending on noise level.
Method improves model performance on segments with local distribution shifts.
problem Improving model generalization across multiple data segments with local distribution differences.
method Two-stage multiply robust estimation method for tabular data analysis.
result Significantly improves prediction accuracy and robustness on regression and classification tasks.
This work addresses local fairness in machine learning models.
problem Ensuring fairness within subregions of feature space, not just global averages.
method Introduces ROAD, a Distributionally Robust Optimization (DRO) approach with adversarial learning.
result Achieves Pareto dominance in local fairness and accuracy across datasets.
This paper investigates WDRO for nonparametric regression, achieving robustness against distributional uncertainty.
problem Addressing model misspecification in nonparametric regression under distributional uncertainty.
method Wasserstein distributionally robust optimization (WDRO) with structural distinction based on Wasserstein distance order.
result Achieves a convergence rate of n−2β/(d+2β) up to logarithmic factors, showing minimax optimality. Proposes sparse local and regional counterfactual rules for robust recourses.
problem Challenges in counterfactual explanations, especially stability, synthesis, and implementation.
method Probabilistic framework using Random Forest to derive sparse local and regional counterfactual rules.
result Effective recourses derived from high-density regions, providing sparse and robust counterfactual rules.
Locally private reinforcement learning protects individual environments from reverse engineering.
problem Protecting private information in distributed reinforcement learning environments.
method Locally differentially private algorithms that protect local agents' models from adversarial reverse engineering.
result Demonstrated that the proposed algorithm performs well under local differential privacy (LDP).
DRFLM improves federated learning by handling data heterogeneity and noise.
problem Data heterogeneity and noise in federated learning.
method Distributionally robust optimization and mixup techniques.
result Enhanced global model prediction accuracy through robust optimization and local mixup.
Today's state-of-the-art image classifiers fail to correctly classify carefully manipulated adversarial images. In this work, we develop a new, localized adversarial attack that generates adversarial examples by imperceptibly altering the backgrounds of normal images. We first use this attack to highlight the unnecessa…
Paper develops robust SVM classifiers for uncertain data.
problem Sensitivity of SVM classifiers to data uncertainty.
method Two probabilistic approaches: Single Perturbation and Extreme Empirical Loss.
result Both methods reduce data uncertainty effects efficiently.
Federated learning improves with adaptive hyper-parameters and representation matching.
problem Heterogeneous client data leads to divergent local models in federated learning.
method Representation matching and adaptive hyper-parameters.
result Significant performance and robustness improvements in federated learning.
Fault-tolerant federated learning for non-uniform data.
problem Faulty workers corrupting data in federated learning.
method Fault-resilient proximal gradient (FRPG) algorithm with Nesterov's acceleration and local FRPG for reduced communication.
result FRPG and LFRPG converge faster than robust stochastic aggregation.