Skip to content

Category

data science

3,017 papers

On-the-go Forgetting without Explicit Unlearning via ERASE

This work introduces ERASE, Erasure via Reconstructive Adversarial Signal Editing, a framework for on-the-go forgetting that suppresses the observable influence of private data without modifying model weights, establishing a scalable, regulation-aligned pathway for continual, privacy-conscious learning.

Kushal Chakrabarti, Mayank Baranwal · 0 citations
#machine learning Preprint Sep 2026

Selective Posterior Margin Regularization for Forward-Corrected Classification

This work introduces Selective Posterior Margin Regularization (SPMR), which preserves the Forward objective and converts this disagreement into a graded update on the clean classifier and transfers to estimated transitions, human annotations, architectural changes, and stronger Forward recipes.

Ze-Xing Zhang, Ji-Chao Li, Tian-Yang Lei et al. · 0 citations
#machine learning Preprint Sep 2026

Online Learning with LLM Experts from Limited Feedback

We study adaptive routing of prompts to large language model (LLM) experts to maximize response quality in an online setting with limited feedback. We formulate it as a bandit problem with $K$ actions that represent experts and $d$ features that encode prompts, over a horizon of $T$ rounds. We propose algorithms that s...

Wei Wang, Soumyabrata Pal, Koyel Mukherjee et al. · 0 citations
#machine learning Preprint Sep 2026

Connecting Score Matching, Maximum Likelihood, and Expectation-Maximization in Mixed Linear Regression

We study variance-preserving diffusion of the response in mixed linear regression (MLR) with unknown mixing weights. Our analysis separates the statistical guarantees of score matching from the loss geometry and optimization signal at a fixed diffusion noise level. The KL divergence links the denoising score matching o...

Zhankun Luo, Abolfazl Hashemi · 0 citations
#artificial intelligence Preprint Aug 2026

Spending Scarce Confirmatory PET Measurements: Target-Aligned Validation in A4/LEARN

This paper applies the A4/LEARN PET archive, treating observed PET as a design laboratory for scarce-confirmation studies and asks a deliberately operational question: when is simple transparent PET validation enough, and when is a fitted residual-uncertainty score worth the added complexity?

E. Cui, Qiang Yang, M. Zhang · 0 citations
#artificial intelligence Preprint Open access Sep 2026

PAC-CF: Calibrating Irreversible Frontier Pruning in LLM-Guided Search

LLM-guided search is usually adopted to solve complex tasks by ranking and pruning top-$K$ candidates based on evaluator scores. However, irreducible bias still exists even if popular methods, such as repeated sampling, are applied to reduce variance. Consequently, pruning may remove every continuation that can reach a...

Tianhao Qian, Jiayu Chen, Lixu Wang · 0 citations

CARE: Confounder-Aware Aggregation for Reliable LLM Evaluation

CARE is introduced, a confounder-aware aggregation framework that explicitly models LLM judge scores as arising from both a latent true-quality signal and shared confounding factors and separates quality from confounders without access to ground-truth labels.

Jitian Zhao, Chang-Ho Shin, Tzu-Heng Huang et al. · 11 citations · ⚡2
#artificial intelligence Preprint Open access Sep 2026

More Bang for the Buck: Improving the Inference of Large Language Models at a Fixed Budget using Reset and Discard (ReD)

The performance of large language models (LLMs) on verifiable tasks is usually measured by pass@k, the probability of answering a question correctly at least once in k trials. At a fixed budget, a more suitable metric is coverage@cost, the average number of unique questions answered as a function of the total number of...

Sagi Meir, Tommer D. Keidar, Noam Levi et al. · 0 citations
#artificial intelligence Open access Nov 2024

DUA-D2C: Dynamic uncertainty aware method for overfitting remediation in deep learning

This study establishes DUA-D2C as a theoretically grounded and effective approach to combating overfitting in modern deep learning, analytically demonstrating how dynamic parameter fusion reduces model variance.

Md. Saiful Bari Siddiqui, Md Mohaiminul Islam, Md. Golam Rabiul Alam · 0 citations

Optimal Experiments for Partial Causal Effect Identification

A general procedure for evaluating epistemic potency in discrete settings is given, and it is shown that ID-pruned experiments are combinatorially inert, yielding a super-exponential reduction in the number of subsets evaluated.

Tobias Maringgele, Jalal Etesami · 0 citations

From tech blogs

See all →
Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.