Recent AI research papers with accessible summaries. Updated daily from arXiv, summarized for developers who don't read papers regularly.
Yucheng Jiang, Zora Zhiruo Wang, Ruishi Chen et al.
By converting raw computer activity into structured task models with goal hierarchies and control flow, TMI enables AI agents to learn realistic work procedures and organizations to audit and reuse task knowledge from employee activity traces.
This paper presents Task Model Induction (TMI), a method that automatically discovers and structures how people actually work on computers by analyzing screenshots and input logs.
Fengqing Jiang, Yite Wang, Boyi Liu et al.
Tool-use capabilities in language models improve significantly when trained during mid-training with targeted synthetic data, rather than waiting until post-training—similar to how math and reasoning skills benefit from dedicated training phases.
MidTool is a data synthesis pipeline that creates training data for teaching language models to use tools effectively during mid-training (the stage between pretraining and fine-tuning).
Zhelun Wu
When combining evidence from multiple sources, separate the task of interpreting each source from aggregating those interpretations—use structured tuples and calibrated scoring rather than simple concatenation and vote counting.
This paper separates evidence interpretation from decision aggregation in multi-source reasoning systems. Instead of concatenating sources into one prompt, the authors propose a structured evidence tuple (hypothesis, reliability, rationale, provenance) and show how to properly combine interpretations using calibrated log-likelihood ratios.
Pin-Yen Huang, Sachin Chhabra, Prasanth Sai Gouripeddi et al.
Hierarchical structure matters: representing recipes as nested sequences of structured steps, rather than flattened tables, lets models learn procedural dependencies and field interactions that improve performance on real-world synthesis and manufacturing tasks.
RecipeNet is a hierarchical Transformer model designed to learn from recipe data—ordered sequences of steps with structured fields—used in materials science, pharmaceuticals, and manufacturing. Unlike traditional tabular methods that flatten this data, RecipeNet captures both field interactions within steps and dependencies across steps, achieving better performance on recipe-based tasks.
Soorya Ram Shimgekar, Michelle Hu, Dorisa Shehi et al.
Automated feature engineering for clinical data is feasible when grounded in clinical guidelines and evidence trails, but requires careful validation and auditing to ensure reliability in real-world healthcare settings.
Researchers built an automated system (nMAS) to extract and engineer features from fragmented heart-failure patient records in electronic health records. The system combines multi-agent AI with clinical guidelines to generate interpretable features, reducing manual work that typically consumes 39-45% of data scientists' time.
Fanzhe Meng, Guoxin Chen, Jiale Zhao et al.
Training agents on tasks calibrated to be appropriately difficult (not too easy, not impossible) using multiple solver feedback produces better generalization than manually authored or single-solver validated tasks.
CalibForge automatically creates training tasks for AI agents by using multiple solvers to identify tasks that are challenging but solvable—the 'learnable zone.' It revises candidate tasks based on solver disagreement and performance patterns, then trains agents on these calibrated tasks, achieving significant improvements on code and repository understanding benchmarks.
Arkajyoti Bhattacharjee, Arnab Auddy
You can privately estimate where data clusters (density modes) with theoretical guarantees on both privacy and accuracy, achieving near-optimal statistical rates that balance the privacy-utility tradeoff.
This paper develops methods for finding density modes (peaks in probability distributions) while guaranteeing differential privacy—a mathematical constraint that limits what can be learned about individual data points. The authors propose DP-GRAMS, which uses noisy gradient ascent on a privately estimated score function, and prove it recovers all modes with near-optimal accuracy.
Juncheng Zhong, Chenghuang Shen, Jianfeng Liu et al.
Decoupling field reconstruction from equation selection—by freezing a learned field representation and then selecting terms via stability-validated weak-form analysis—improves PDE discovery from sparse observations compared to end-to-end neural approaches.
This paper tackles PDE discovery from sparse data by separating field reconstruction from equation selection. The authors develop a freeze-then-select method that first trains a neural adapter to reconstruct the continuous field, then uses stability-validated weak selection to identify the correct differential terms.
Anjian Li, Ryne Beeson
Collecting intermediate solver iterations during optimization—not just final solutions—significantly increases training data for learning-based optimization without additional computational cost, with theoretical guarantees on generalization.
This paper addresses data scarcity in training models that generate initial guesses for optimization problems. The authors propose collecting intermediate solver steps (k-neighborhoods) alongside final solutions to increase training data without extra computation.
Korota Arsène Coulibaly, Mohamed Hamlich, Khalid Hmali et al.
Synthetic data generation can effectively replace scarce real-world defect images for training industrial quality control systems, achieving strong performance on real data while eliminating costly manual annotation.
This paper presents a synthetic data generation framework that automatically creates realistic images of printing defects (creases, streaks, misregistration) with annotations for training object detection models. The framework solves a critical problem in rotogravure printing: the extreme scarcity of real defect images needed to train deep learning models.
Gabriel Samberg, YoonHaeng Hur, Yuehaw Khoo et al.
When matching clustered point clouds, regularizing optimal transport with Laplacian terms from similarity graphs produces more meaningful alignments by respecting cluster structure instead of forcing precise point-to-point correspondence.
This paper proposes Laplacian Optimal Transport (LapOT), a method for matching point clouds that respects their cluster structure rather than forcing point-by-point alignment. By adding graph-based regularization to optimal transport, the approach finds region-to-region alignments that are more robust when points within clusters are interchangeable.
Ramin Soleimani, Andrea Visentin, Dirk Pesch
Inferring and embedding behavioral patterns inside the forecasting model—rather than using them only for grouping—improves electricity load predictions for diverse households, especially when you have limited historical data.
This paper improves residential electricity demand forecasting by embedding behavioral patterns directly into a Neural Process model. Instead of just grouping similar households, the model learns discrete behavioral structures (like weekday vs. weekend routines) and uses them to condition predictions, while also capturing uncertainty across different household types.
Ren Takahashi, Emre Yusuf, Jayabrata Bhaduri
Topological features derived from phase-space geometry of EEG outperform traditional spectral features for dream detection, suggesting that the shape of neural activity patterns matters more than their energy content.
This paper introduces PHINN-EEG, a topological data analysis framework for detecting dream states from EEG signals. Instead of traditional power spectrum features, it uses persistent homology to extract geometric patterns (Dynamic Betti Curves) from neural activity, aiming to improve dream detection accuracy from 70% to 82-90% AUC.
Yifan Zhou, Qihao Yang, Yan Li et al.
Current LLMs struggle with scientific lineage reasoning (only 27.3% accuracy), suggesting AI systems need better mechanisms to understand how ideas inherit, mutate, and recombine across research communities.
This paper introduces IdeaGene-Bench, a benchmark for evaluating whether AI systems can understand how scientific ideas evolve and build on each other. It represents papers as 'Idea Genomes' with tracked inheritance patterns, and tests both reasoning about scientific lineages and generating new ideas that fit coherently into existing research traditions across 10 scientific domains.
Zhuowei Chen, Xiang Lorraine Li
By analyzing which neurons activate during model predictions, you can automatically select better training data and improve self-supervised learning without any human annotations—useful when expert labels are expensive or unavailable.
This paper proposes Neuron-OPSD, a method for improving large language models without human labels by using the model's internal neuron activations to select which training examples to learn from and how to construct better teacher models. The approach trains the model on its own predictions, achieving better performance on specialized tasks while maintaining general knowledge.
Kent K. Chang
Language models used for cultural analysis aren't neutral measurement tools; their architecture, training data, and evaluation methods actively constitute the cultural phenomena they claim to measure, making methodological choices inherently ethical decisions.
This paper examines how language models measure cultural phenomena, arguing that the models, data, and evaluation methods don't just record culture—they actively shape what counts as cultural reality.
Kirill Solovev, Jana Lasser
Open-weight multilingual NLP can scale political network analysis beyond manual coding, extracting signed relationships from news at scale while remaining reproducible and avoiding proprietary APIs.
This paper presents an open-source pipeline for automatically extracting political relationships from multilingual news articles. It combines named-entity recognition, entity linking to Wikidata, and a specialized model to build knowledge graphs of political networks—showing it can reconstruct party lifecycles and uncover patronage networks in Austria and Poland.
Nicholas Pulsone, Gregory Goren, Roee Shraga
Distribution alignment is critical for entity matching in low-resource settings—understanding which algorithmic choices matter most helps practitioners build more reliable data integration systems with limited supervision.
This paper investigates BEACON, a method for matching records across databases when you have limited labeled data and domain knowledge. The researchers test how different design choices and data availability affect performance, revealing insights about how distribution alignment helps the system adapt to new domains.