Skip to content

Category

data science

3,344 papers

#artificial intelligence Open access 2026

Bridging Humans and LLMs: Investigating Human-AI Collaboration in Multi-agent Requirements Analysis for Organizational AI Adoption

LLM-based multi-agent systems can support strategic AI planning by enabling iterative refinement with human experts by supporting structured and collaborative Requirements Engineering processes for AI adoption planning.

Malik Abdul Sami, Zheying Zhang, Muhammad Waseem et al. · 6 citations
#data science Preprint Aug 2026

GRAS: Guided Reduced-Variance Proposals and Adaptive Selection for Training-Free Reward Alignment in Discrete Diffusion

GRAS is simple yet effective: across regulatory DNA and protein design it attains the best training-free reward, outperforming prior training-free methods and matching or surpassing a reward-fine-tuned model, and it remains effective even for non-differentiable rewards.

Kwanyoung Kim · 0 citations
#artificial intelligence Review Open access 2026

Secure AI Systems Protecting Machine Learning Models from Emerging Cyber Threats

Securing AI systems is not a task any single discipline can accomplish alone; it requires sustained collaboration between machine learning researchers, cybersecurity professionals, and policymakers if AI technologies are to remain reliable, trustworthy, and resilient in adversarial environments.

Harsh Verma · 1 citation
#data science Preprint Aug 2026

When Is the Sharp Covariance Envelope Tight? Feature-Only Geometry for Volume-Sampled Least Squares

Prior analyses by Derezinski and Warmuth established all-size sampling identities, selected-OLS unbiasedness, and inverse moments for ordinary volume sampling, while their exact arbitrary-fixed-response loss and prediction-covariance formulas are at the rank-size endpoint s=d. We establish a Loewner envelope for center...

Kihun Rhee · 0 citations
#data science Preprint Jul 2026

Efficient Clustering with Provable Guardrails for LLM Inference at Scale

This work proposes a two-stage algorithm that generates initial clusters with Mini-batch K-Means, then greedily selects representatives within each initial cluster -- a step equivalent to the Johnson-Chvatal heuristic for Set Cover over alpha-balls in embedding space.

Longshaokan Wang, Wai Tsang Keung, Punit Ghodasara et al. · 0 citations
#computer vision Review Aug 2026

REFINE: A Multi-Agent LLM Approach for Evidence-Guided Code Refactoring

This work introduces REFINE (Refactoring with Evidence-aware Flow for Integrated ageNtic Execution), a tool-agnostic, evidence-aware multi-agent approach for generating Java file-level refactoring candidates that achieves a higher median code-smell reduction with smaller edits and fewer public-method removals.

Muhammad Waseem, Aakash Ahmad, Pekka Abrahamsson · 0 citations
#machine learning Preprint Aug 2026

Interpretable AI with Local Distillation

Local distillation is proposed, in which a black-box teacher guides a regularized linear"student" model at each query point, and it is proved that this randomization yields feature-selection probabilities that are stable under small perturbations of the training responses.

Erin Craig, Yiling Huang, Snigdha Panigrahi · 0 citations
#natural language process... Preprint Aug 2026

QUASAR: Lowering the Loss Floor of Quantization-Aware Training with Loss-Aware Reconstruction

QUASAR is introduced, a QAT method that continuously performs lightweight, loss-aware reconstruction in the training loop to lower the loss floor and improve the resulting low-bit model, establishing QUASAR's objective as a principled optimization target.

Vincent Counathe, Ben Athiwaratkun, C. De Sa et al. · 1 citation
#machine learning Preprint Aug 2026

SR-OPSD: Self-Referenced On-Policy Self-Distillation

Extensive experiments across scientific evaluation, mathematical reasoning, and coding generation tasks with multiple large language models show that SR-OPSD achieves the state-of-the-art or competitive performance across various settings.

Zhuo Sun, Entong Li, Yan-Long Zhao et al. · 0 citations
#machine learning Preprint Aug 2026

Comparing Corrupted Constrained Learning Problems

A generalized data processing inequality is formulated, requiring the constrained Bayes risk of a joint distribution to lower bound the constrained Bayes risk on the stochastically modified distribution, regardless of the choice of distribution, to be equivalent to a set containment condition on a specific function set...

Laura Iacovissi, Rabanus Derr, Robert C. Williamson · 0 citations
#data science Preprint Jul 2026

Linear Independent Component Analysis via Optimal Transport

It is proved that the Wasserstein distance between a standard normal distribution and linear projections of the data is maximized when the projection recovers an independent component, and the OT-ICA algorithm which finds this projection by gradient-based optimization is proposed.

Ashutosh Jha, M. Besserve, Simon Buchholz · 1 citation

From tech blogs

See all →
MIT News · Artificial Intelligence Oct 23, 2026

Reinforcing the value of human understanding at MIT

During the School of Humanities, Arts, and Social Sciences’ 75th Anniversary Symposium, President Sally Kornbluth said “MIT has never needed your particular insight and guidance more than we do now.”

Microsoft Research Blog Oct 22, 2026

Flint-interactive: A language for creating interactive data visualizations

Flint-interactive gives AI agents a language for creating interactive visualizations. Click a chart, filter data, highlight related content, and explore beyond the view the author originally chose. The post Flint-interactive: A language for creating interactive data visualizations 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.