ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “distribution shift”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

stat.MLcs.AIcs.LGRecentMay 29, 2026

Entropic Projection Alignment: Estimating, Explaining, and Improving Model Performance Under Distribution Shift

Salim I. Amoukou, Emanuele Albini, Tom Bewley, Saumitra Mishra +1 more

The paper introduces Entropic Projection Alignment (EPA), a unified framework that estimates, explains, and improves model performance under distribution shift by aligning source and target distributi…

View →
cs.AIcs.LGEmpiricalRecentJun 18, 2026

Toward Calibrated Mixture-of-Experts Under Distribution Shift

Gina Wong, Drew Prinster, Suchi Saria, Rama Chellappa +1 more

This paper studies the behavior of mixture-of-experts (MoE) models under distribution shift and proposes an adversarial reweighting method to improve their calibration.

View →
cs.CVEmpiricalRecentJul 16, 2026

CRISP: Constrained Refinement via Iterative Squeezing Process for Robust Medical Image Segmentation under Domain Shift

Yizhou Fang, Pujin Cheng, Yixiang Liu, Xiaoying Tang +1 more

This paper proposes CRISP, a model-agnostic framework for source-only medical image segmentation under distribution shift, which uses rank stability of positive regions to derive robust spatial priors…

View →
cs.LGcs.AIRecentMay 29, 2026

What changes after deployment? A survey on On-device Learning in TinyML

Massimo Pavan, Luca Pezzarossa, Fabrizio Pittorino, Manuel Roveri +1 more

This survey analyzes the field of On-device Learning (ODL) for TinyML by categorizing existing works based on how they address various types of post-deployment distribution changes.

View →
cs.ARcs.ETEmpiricalRecentJun 27, 2026

SHIFT: Dynamic Compute Relocation Framework for Communication-Aware Chiplet-Based Systems

Arvin Delavari, Leonid Popryho, Inna Partin-Vaisband, Boris Vaisband

This paper proposes SHIFT, a topology-agnostic approach for communication-aware workload placement and routing optimization in large-scale heterogeneous systems, achieving up to 12.5x throughput impro…

View →
cs.DSTheoreticalRecentJun 19, 2026

Online Stacking with a Few Load/Unload Points

Martin Olsen

A simple online algorithm is presented for the stacking problem to avoid shifts with a sufficient condition involving stacking area dimension, load/unload points, and maximum items.

View →
cs.CVcs.CRRecentMar 31, 2026

SHIFT: Stochastic Hidden-Trajectory Deflection for Removing Diffusion-based Watermark

Rui Bao, Zheng Gao, Xiaoyu Li, Xiaoyan Feng +2 more

The paper introduces SHIFT, a training-free attack that exploits the vulnerability of diffusion-based watermarking by stochastically deflecting the generative trajectory, achieving high removal rates…

View →
cs.LGcs.AIcs.CRRecentJun 1, 2026

Fair Finetuning Mitigates Distribution Inference Attacks

Rakshit Naidu

The paper proposes Fair Fine-tuning (FFt), a method that fine-tunes a model using an Equalized Odds constraint on a complementary distribution, and theoretically proves that this approach significantl…

View →
cs.LGcs.AIcs.CRRecentJun 1, 2026

Fair Finetuning Mitigates Distribution Inference Attacks

Rakshit Naidu

The paper proposes Fair Fine-tuning (FFt), a method that fine-tunes a model using an Equalized Odds constraint on a complementary distribution, and provides a formal theoretical bound linking this fai…

View →
cs.LGcs.AIRecentMay 29, 2026

DARTS: Distribution-Aware Active Rollout Trajectory Shaping for Accelerating LLM Reinforcement Learning

Yujie Wang, Siwei Chen, Longzan Luo, Xinyi Liu +3 more

The paper proposes DARTS, a distribution-aware active rollout trajectory shaping method that fundamentally accelerates LLM reinforcement learning by actively shaping the long-tail response distributio…

View →
stat.MLcs.LGstat.MEEmpiricalRecentJul 26, 2026

Distributional Split Criteria for Random Forests: Extensions, Shrinkage, and the Robustness of Mean Splitting

Silas Koemen

This paper introduces Distributional Random Forests, which replace mean-based CART splitting with criteria that compare full conditional response distributions in candidate children. The authors syste…

View →
cs.NEEmpiricalRecentJul 24, 2026

Sensitivity of hMPA to Controlled CEC 2017 Transformations

Grzegorz Sroka, Sławomir T. Wierzchoń

The paper introduces a parameterized implementation to analyze the effects of bias, shift, and rotation on the Marine Predators Algorithm using the CEC 2017 benchmark.

View →
cs.DScs.CCcs.LGTheoreticalRecentJul 17, 2026

Testing Distributions Against Bounded Distinguishers

Mark Bun, Rathin Desai, Renato Ferreira Pinto

This paper studies distribution testing with respect to bounded classes of distinguishers, revealing connections between testable learning, verification of learning algorithms, and testing of structur…

View →
cs.CRcs.DCcs.ITRecentApr 15, 2026

Temporary Power Adjusting Withholding Attack

Mustafa Doger, Sennur Ulukus

The paper introduces Temporary Power Adjusting Withholding (T-PAW), a generalized and more potent block withholding attack than the existing PAW attack, demonstrating that this attack can yield signif…

View →
cs.CRcs.DSRecentApr 30, 2026

Variational and Majorization Principles in Lattice Reduction

Javier Blanco-Romero, Florina Almenares Mendoza

The paper uses majorization theory to analyze lattice reduction, showing that local swaps smooth the Gram-Schmidt profile and deriving variational and telescoping identities for the worst-case profile…

View →
cs.LGmath.STstat.MLTheoreticalRecentJul 24, 2026

Beyond Negative-Ridge Endpoints: Mixed-Sign Spectral Regularization via Negative-Shifted Gradient Descent

Peng Zhao

This paper proposes a method for handling overparameterized linear regression using early-stopped negative-shifted gradient descent, which allows for smooth filters and mixed-sign capabilities.

View →
stat.MLcs.AIcs.LGRecentMay 28, 2026

Improved Distribution Estimation in $\ell_\infty$

Doron Cohen, Aryeh Kontorovich, Yonatan Livshitz

This paper improves the theoretical bounds for estimating discrete probability distributions using the $\ell_\infty$ norm, resolving several open questions in the field.

View →