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,695 papers · 148 categories

Trend · papers per month

155310465620 · Jun 202019922001200920172026
48 results for Marginal Distribution Shift Asymmetry

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.

Proposes a new portfolio optimization method considering reward, dispersion, and asymmetry.

problem Capturing fat-tails and asymmetry in asset return distributions.
method Market model with tempered stable distribution; extended mean-variance optimization.
result Closed-form solutions for VaR and CVaR; efficient frontier extended to three dimensions.

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.

Semantic paraphrases can fool financial sentiment classifiers due to geometric shifts in model representations.

problem Semantic paraphrase attacks on financial sentiment classifiers
method Developing a continuous local model of semantic paraphrase perturbations
result The worst-case local displacement of the target representation is governed by the largest generalised eigenvalue of a matrix pencil constructed from the Jacobians of the two embedding maps.

Skew Gaussian Processes improve classification performance by allowing asymmetry.

problem Limited use of Gaussian processes in applications requiring asymmetry.
method Propose Skew-Gaussian processes (SkewGPs) as a non-parametric prior over functions, extending the multivariate Unified Skew-Normal distribution to stochastic processes.
result SkewGPs provide better performance than symmetric Gaussian processes in classification tasks.

A new model optimizes portfolios by accounting for dynamic market conditions.

problem Static models fail to capture asymmetry, heavy tails, and time-varying dependencies.
method Semiparametric dynamic copula model integrating non-parametric copulas and parametric marginals.
result Dynamic market conditions improve portfolio performance and risk management.

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

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.

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 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.

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.

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.

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 ↗

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.

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.

Inverse statistics in economics is considered. We argue that the natural candidate for such statistics is the investment horizons distribution. This distribution of waiting times needed to achieve a predefined level of return is obtained from (often detrended) historic asset prices. Such a distribution typically goes t…

2002-11-02abs ↗pdf ↗

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.

The paper integrates behavioral distortions into portfolio optimization using implied probability weighting functions.

problem Behavioral distortions in probability weighting affect portfolio optimization under different return distributions.
method Developed a unified framework to extract probability weighting functions from optimal portfolios modeled under Gaussian and NIG distributions.
result Increasing tail fatness amplifies behavioral distortions, and shifts in risk-free rates alter the curvature of these distortions.

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.

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.

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 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.

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 ↗

A new method for self-attention models that improves uncertainty estimation.

problem Overconfident predictions and lack of calibrated uncertainty in Transformers.
method Kernel-Eigen Pair Sparse Variational Gaussian Processes (KEP-SVGP) with Kernel SVD (KSVD) to handle asymmetry of attention kernels.
result Reduction in time complexity and improved performance on various benchmarks.

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.

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.

Modified Jones-Faddy skew t-distribution captures asymmetry in stock returns.

problem Negative skew and positive mean in stock returns due to broken symmetry of stochastic volatility.
method Modified Jones-Faddy skew t-distribution applied to split gains and losses, using stochastic differential equations for stock returns and volatility.
result The modified distribution effectively captures the asymmetry in daily S&P500 returns, including its tails.

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.

CP improves robustness against distribution shift using physics-informed structural causal models.

problem Uncertainty in machine learning predictions under distributional shift.
method Physics-informed structural causal model (PI-SCM) to upper bound coverage difference.
result PI-SCM improves coverage robustness across confidence levels and test domains.

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.

Study tackles distribution shift in combinatorial settings using matrix completion techniques.

problem Tackling distribution shift in combinatorial settings with rigorous statistical guarantees.
method Develops novel algorithms and theoretical results for extrapolating to test distributions not covered in training.
result Achieves bilinear combinatorial extrapolation under gradual spectral decay in high-dimensional data.

TTLSA adapts models to label shifts across domains with nuisance factors.

problem Adapting models to changes in label distributions with nuisance factors.
method TTLSA uses EM on unlabeled samples to adapt a trained model to new label distributions.
result TTLSA improves model performance over invariance methods and baseline methods.

New method improves uncertainty calibration in deep learning.

problem Systematic overconfidence in EDL on out-of-distribution inputs.
method Density-Informed Pseudo-count EDL (DIP-EDL) separates class prediction from uncertainty.
result DIP-EDL achieves asymptotic concentration and enhances robustness and uncertainty calibration.