Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

4692138184 · May 202619922001200920172026
48 results for margin shift

A new approach to cost-sensitive multiclass classification prioritizes certain classes over others.

problem Cost-sensitive multiclass classification where some classes are more important than others.
method Apportioned margin framework that shifts the decision boundary to prioritize certain classes.
result The method improves the error rate for important classes while reducing overall error.

Paper proposes a new regularization method to prevent model degradation under distribution shifts.

problem Model performance degrades under distribution shifts.
method Supervised contrastive learning with heterogeneous similarity.
result The proposed method outperforms existing regularization methods on benchmark datasets.

Gradient-based methods can be biased by distributional asymmetries in bivariate categorical data.

problem Gradient-based causal discovery methods can be biased by distributional asymmetries in bivariate categorical data.
method Identified and examined two distributional biases: Marginal Distribution Asymmetry and Marginal Distribution Shift Asymmetry. Employed two simple models to demonstrate and control these biases.
result Gradient-based methods can be biased by distributional asymmetries, and these biases can be controlled.

Audited Conformal Prediction improves conditional coverage in pretrained models under distribution shift.

problem Uncertainty quantification for pretrained models under unknown distribution shift
method Leverages a small labeled dataset to train an audit model for marginal coverage, integrates outputs into conformal prediction framework
result Significantly higher conditional coverage than existing approaches

Paper tackles dynamic label shift in online learning, achieving optimal performance.

problem Adapting to changing class marginals in online supervised and unsupervised learning.
method Develops novel algorithms reducing adaptation to online regression, achieving optimal dynamic regret.
result Achieves superior performance in various online label shift scenarios.

DeepCCG adapts classifiers to representation shifts in one step.

problem Adapting classifiers to shifts in continuous representation.
method Empirical Bayesian approach using class conditional Gaussian classifier and KL divergence for selection.
result DeepCCG reduces performance change due to representation shifts.

Optimal transport aligns source and target distributions for domain adaptation.

problem Unsupervised domain adaptation with joint class-conditional and label shifts.
method Minimizes importance weighted loss and Wasserstein distance for aligned marginals and class-conditional distributions.
result Our method outperforms competitors on various domain adaptation tasks.

Faced with distribution shift between training and test set, we wish to detect and quantify the shift, and to correct our classifiers without test set labels. Motivated by medical diagnosis, where diseases (targets) cause symptoms (observations), we focus on label shift, where the label marginal p(y)p(y) changes but the …

2018-02-12abs ↗pdf ↗

Paper proposes SJS model to estimate model performance under covariate and label shifts.

problem Estimating model performance when both covariates and labels shift.
method Sparse Joint Shift (SJS) model and SEES algorithm.
result SEES achieves significant shift estimation error improvements over existing approaches.

Paper introduces a method to create robust representations against covariate shifts.

problem Distribution shift between training and testing data in machine learning.
method Introduces a variational objective with two components: discriminative representation and invariant support.
result Optimal representations ensure robustness to covariate shifts, improving performance on DomainBed.

New framework using Jensen-Shannon divergence improves domain adaptation theory.

problem Incoherence between empirical domain adversarial training and theoretical H\mathcal{H}-divergence.
method Established new theoretical framework based on Jensen-Shannon divergence, derived bi-directional upper bounds.
result Framework exhibits flexibilities for various transfer learning problems.

Estimates calibration error under label shift without labels.

problem Ensuring model reliability in the face of dataset shift without access to labels.
method Importance re-weighting of the labeled source distribution to estimate calibration error under label shift.
result Effective and reliable CE estimation with respect to the shifted target distribution.

Proposes a method to improve regression model performance with limited target data using fused-regularizer.

problem Model shifts and covariate shifts in high-dimensional regression.
method Two-step method with fused-regularizer to leverage source data for target task.
result Robust to covariate shifts, minimax-optimal under certain conditions, and validated by numerical tests.

New DP algorithms with margin guarantees for various hypothesis sets.

problem Differential privacy in machine learning with margin guarantees.
method Developed pure and efficient DP learning algorithms for linear, kernel-based, and neural network hypotheses.
result Margin guarantees are independent of input dimension and hypothesis type.

ELSA efficiently adapts to label shift without post-prediction calibrations.

problem Domain adaptation with label shift across training and testing datasets.
method Moment-matching framework based on influence function geometry; solves linear systems for adaptation weights.
result ELSA estimator is n\sqrt{n}-consistent and asymptotically normal, achieving state-of-the-art estimation performance.

This paper explores how effective sample size, dimensionality, and model performance are related in covariate shift adaptation.

problem Understanding the relationship between effective sample size, dimensionality, and generalization in covariate shift adaptation.
method Building a unified theory connecting effective sample size, data dimensionality, and generalization in the context of covariate shift adaptation.
result Dimensionality reduction or feature selection can increase effective sample size, supporting the practice of reducing dimensionality before covariate shift adaptation.

RLSbench benchmarks domain adaptation under label proportion shifts, revealing widespread failures and proposing a two-step meta-algorithm.

problem Domain adaptation under label proportion shifts is poorly understood and inconsistent across methods.
method RLSbench introduces a large-scale benchmark with 500 distribution shift pairs. It proposes a two-step meta-algorithm to improve domain adaptation methods under label proportion shifts.
result The two-step meta-algorithm improves domain adaptation methods by 2-10% accuracy points under large label proportion shifts.

Adaptive monitoring for AI systems detects and diagnoses shifts in data distribution.

problem Continuous monitoring of AI systems to detect and address unsafe behavior.
method Weighted-conformal martingales (WCTMs) for online monitoring of AI systems.
result Improved performance over state-of-the-art baselines on real-world datasets.

Supervised learning with large scale labeled datasets and deep layered models has made a paradigm shift in diverse areas in learning and recognition. However, this approach still suffers generalization issues under the presence of a domain shift between the training and the test data distribution. In this regard, unsup…

2016-02-10abs ↗pdf ↗

The paper improves conformal prediction by analyzing the beta law of conditional coverage.

problem Improving finite-sample marginal coverage guarantees for non-i.i.d. data.
method The method uses Wasserstein distances to quantify deviations from the beta law of conditional coverage.
result The framework provides direct bounds on marginal coverage gaps and bad-calibration probabilities.

New CPS model tackles conditional probability shift in machine learning.

problem Discrepancy between source and target distributions in machine learning.
method Conditional Probability Shift Model (CPSM) using multinomial regression and EM algorithm.
result Superior balanced classification accuracy on target data compared to existing methods.

Method constructs nonparametric prediction intervals with finite-sample guarantees.

problem Nonparametric instrumental variable regression with finite-sample coverage.
method Conformal inference framework applied to NPIV, combining with various estimators.
result Distribution-free, finite-sample coverage over chosen IV shifts.

Proposes a new method to adapt to covariate shifts in supervised learning.

problem Covariate shift in training and testing samples with different marginal distributions.
method Minimax risk classification (MRC) approach that weights both training and testing samples.
result Significantly enhanced classification performance in synthetic and empirical experiments.

Study shows pretraining and finetuning can effectively tackle covariate shift in linear regression.

problem Linear regression under covariate shift where source and target distributions differ but conditional distribution remains similar.
method Pretraining on source data and finetuning on target data using online SGD.
result Transfer learning with O(N2)O(N^2) source data is as effective as supervised learning with NN target data.

New method improves consistency in preference learning for neural networks.

problem Inconsistent surrogate losses in preference learning for neural networks.
method Formulated a margin-shifted ranking framework and introduced Structure-Aware HH-consistency.
result Proved superior consistency guarantees for capacity-bounded models using heavy-tailed surrogates.

This paper establishes non-asymptotic learning bounds for the DR covariate shift adaptation.

problem Distribution shift between training and test domains in machine learning.
method Doubly-robust (DR) estimator combining density ratio estimation and pilot regression model.
result First non-asymptotic learning bounds for DR covariate shift adaptation.

Domain adaptation is an important technique to alleviate performance degradation caused by domain shift, e.g., when training and test data come from different domains. Most existing deep adaptation methods focus on reducing domain shift by matching marginal feature distributions through deep transformations on the inpu…

2019-06-24abs ↗pdf ↗

New method for valid prediction sets in high-dimensional covariate shifts.

problem Valid prediction sets in high-dimensional covariate shifts.
method Likelihood-ratio regularized quantile regression (LR-QR) algorithm.
result LR-QR constructs valid prediction sets with desired coverage in target domain.

This paper explores conditions for neural networks to extrapolate to new domains.

problem Understanding when neural networks can extrapolate to unseen domains.
method Analyzes conditions for nonlinear models to extrapolate under specific distribution shifts.
result Neural networks of the form f(x)=fi(xi)f(x)=\sum f_i(x_i) can extrapolate if feature covariance is well-conditioned.

This paper extends performative prediction to nonlinear cases.

problem Performative prediction's effectiveness is limited by linear assumptions in real-world applications.
method Formulated a maximum margin approach loss function and extended it to nonlinear spaces using kernel methods.
result Derived conditions for performative stability in both linear and nonlinear cases.

This paper proposes a new method to improve domain adaptation by distinguishing between marginal and dependence structure differences.

problem Existing domain adaptation methods fail to differentiate between marginal and dependence structure differences, leading to suboptimal transferability.
method The paper introduces a new approach that measures and optimizes the differences in internal dependence structure separately from marginals.
result The new method significantly improves transferability and robustness compared to existing benchmarks on real-world datasets.

We present new minimax results that concisely capture the relative benefits of source and target labeled data, under covariate-shift. Namely, we show that the benefits of target labels are controlled by a transfer-exponent γγ that encodes how singular Q is locally w.r.t. P, and interestingly allows situations where tr…

2018-03-05abs ↗pdf ↗

Adam's bias shifts from full-batch to max-margin of different norms for separable data.

problem Understanding Adam's implicit bias in the incremental batch setting.
method Analyzing incremental Adam on linearly separable data, constructing datasets, and using a proxy algorithm.
result Incremental Adam can converge to different max-margin classifiers depending on the dataset and batching scheme.