Education
ChatGPT's Study Mode Is Here. It Won't Fix Education's AI Problems
The school year starts soon for many students, and ChatGPT has announced a new "study mode" that aims to prevent--or at least, encourage against--students taking homework shortcuts. The mode is designed around the Socratic method, so when activated, OpenAI's generative AI chatbot rejects direct requests for answers, instead guiding the user with open-ended questions. The new study mode is available to most logged-in users of ChatGPT, including those on the free version. OpenAI has significantly disrupted the education system over the past few years, with students becoming some of the earliest adopters of ChatGPT. Even so, OpenAI claims the bot is currently an overall boon to learners--if asked to roleplay as a synthetic tutor.
The untapped potential AI can't replace in underserved communities like mine
Pastor and Project H.O.O.D. founder Corey Brooks says the'honest work' learned through trade schools could be the key out of poverty for many struggling in today's job market wanting to'improve their lives.' The crime of post-60s liberalism is that it created permanent Black underclasses all over America, including on the South Side of Chicago where I live. The schools here are poor. Opportunities have been replaced by government handouts. Violence robs far too many families of their loved ones.
Why does the beach make you so tired?
Breakthroughs, discoveries, and DIY tips sent every weekday. No responsibilities and little to do but enjoy yourself. Yet somehow, after a whole day of blissful nothing, you find yourself completely zonked. If taking in the sea air is supposed to be restorative, why can a restful day at the beach end up feeling so tiring? There's no one certain answer, but science offers a few possibilities.
Imitation Learning in Continuous Action Spaces: Mitigating Compounding Error without Interaction
Zhang, Thomas T., Pfrommer, Daniel, Matni, Nikolai, Simchowitz, Max
We study the problem of imitating an expert demonstrator in a continuous state-and-action dynamical system. While imitation learning in discrete settings such as autoregressive language modeling has seen immense success and popularity in recent years, imitation in physical settings such as autonomous driving and robot learning has proven comparably more complex due to the compounding errors problem, often requiring elaborate set-ups to perform stably. Recent work has demonstrated that even in benign settings, exponential compounding errors are unavoidable when learning solely from expert-controlled trajectories, suggesting the need for more advanced policy parameterizations or data augmentation. To this end, we present minimal interventions that provably mitigate compounding errors in continuous state-and-action imitation learning. When the system is open-loop stable, we prescribe "action chunking," i.e., predicting and playing sequences of actions in open-loop; when the system is possibly unstable, we prescribe "noise injection," i.e., adding noise during expert demonstrations. These interventions align with popular choices in modern robot learning, though the benefits we derive are distinct from the effects they were designed to target. Our results draw insights and tools from both control theory and reinforcement learning; however, our analysis reveals novel considerations that do not naturally arise when either literature is considered in isolation.
Statistical Inference for Differentially Private Stochastic Gradient Descent
Xia, Xintao, Zhang, Linjun, Cai, Zhanrui
Privacy preservation in machine learning, particularly through Differentially Private Stochastic Gradient Descent (DP-SGD), is critical for sensitive data analysis. However, existing statistical inference methods for SGD predominantly focus on cyclic subsampling, while DP-SGD requires randomized subsampling. This paper first bridges this gap by establishing the asymptotic properties of SGD under the randomized rule and extending these results to DP-SGD. For the output of DP-SGD, we show that the asymptotic variance decomposes into statistical, sampling, and privacy-induced components. Two methods are proposed for constructing valid confidence intervals: the plug-in method and the random scaling method. We also perform extensive numerical analysis, which shows that the proposed confidence intervals achieve nominal coverage rates while maintaining privacy.
Improving Group Fairness in Tensor Completion via Imbalance Mitigating Entity Augmentation
Ahn, Dawon, Jang, Jun-Gi, Papalexakis, Evangelos E.
Group fairness is important to consider in tensor decomposition to prevent discrimination based on social grounds such as gender or age. Although few works have studied group fairness in tensor decomposition, they suffer from performance degradation. To address this, we propose STAFF(Sparse Tensor Augmentation For Fairness) to improve group fairness by minimizing the gap in completion errors of different groups while reducing the overall tensor completion error. Our main idea is to augment a tensor with augmented entities including sufficient observed entries to mitigate imbalance and group bias in the sparse tensor. We evaluate \method on tensor completion with various datasets under conventional and deep learning-based tensor models. STAFF consistently shows the best trade-off between completion error and group fairness; at most, it yields 36% lower MSE and 59% lower MADE than the second-best baseline.
Fast Last-Iterate Convergence of SGD in the Smooth Interpolation Regime
Attia, Amit, Schliserman, Matan, Sherman, Uri, Koren, Tomer
We study population convergence guarantees of stochastic gradient descent (SGD) for smooth convex objectives in the interpolation regime, where the noise at optimum is zero or near zero. The behavior of the last iterate of SGD in this setting -- particularly with large (constant) stepsizes -- has received growing attention in recent years due to implications for the training of over-parameterized models, as well as to analyzing forgetting in continual learning and to understanding the convergence of the randomized Kaczmarz method for solving linear systems. We establish that after $T$ steps of SGD on $ฮฒ$-smooth convex loss functions with stepsize $0 < ฮท< 2/ฮฒ$, the last iterate exhibits expected excess risk $\widetilde{O}(\frac{1}{ฮท(2-ฮฒฮท) T^{1-ฮฒฮท/2}} + \fracฮท{(2-ฮฒฮท)^2} T^{ฮฒฮท/2} ฯ_\star^2)$, where $ฯ_\star^2$ denotes the variance of the stochastic gradients at the optimum. In particular, for a well-tuned stepsize we obtain a near optimal $\widetilde{O}(1/T + ฯ_\star/\sqrt{T})$ rate for the last iterate, extending the results of Varre et al. (2021) beyond least squares regression; and when $ฯ_\star=0$ we obtain a rate of $\smash{O(1/\sqrt T)}$ with $ฮท=1/ฮฒ$, improving upon the best-known $\smash{O(T^{-1/4})}$ rate recently established by Evron et al. (2025) in the special case of realizable linear regression.
Multi-Agent-as-Judge: Aligning LLM-Agent-Based Automated Evaluation with Multi-Dimensional Human Evaluation
Chen, Jiaju, Lu, Yuxuan, Wang, Xiaojie, Zeng, Huimin, Huang, Jing, Gesi, Jiri, Xu, Ying, Yao, Bingsheng, Wang, Dakuo
Nearly all human work is collaborative; thus, the evaluation of real-world NLP applications often requires multiple dimensions that align with diverse human perspectives. As real human evaluator resources are often scarce and costly, the emerging "LLM-as-a-judge" paradigm sheds light on a promising approach to leverage LLM agents to believably simulate human evaluators. Yet, to date, existing LLM-as-a-judge approaches face two limitations: persona descriptions of agents are often arbitrarily designed, and the frameworks are not generalizable to other tasks. To address these challenges, we propose MAJ-EVAL, a Multi-Agent-as-Judge evaluation framework that can automatically construct multiple evaluator personas with distinct dimensions from relevant text documents (e.g., research papers), instantiate LLM agents with the personas, and engage in-group debates with multi-agents to Generate multi-dimensional feedback. Our evaluation experiments in both the educational and medical domains demonstrate that MAJ-EVAL can generate evaluation results that better align with human experts' ratings compared with conventional automated evaluation metrics and existing LLM-as-a-judge methods.
Zero-Shot Learning with Subsequence Reordering Pretraining for Compound-Protein Interaction
Zhang, Hongzhi, Liu, Zhonglie, Meng, Kun, Chen, Jiameng, Wu, Jia, Du, Bo, Lin, Di, Che, Yan, Hu, Wenbin
Given the vastness of chemical space and the ongoing emergence of previously uncharacterized proteins, zero-shot compound-protein interaction (CPI) prediction better reflects the practical challenges and requirements of real-world drug development. Although existing methods perform adequately during certain CPI tasks, they still face the following challenges: (1) Representation learning from local or complete protein sequences often overlooks the complex interdependencies between subsequences, which are essential for predicting spatial structures and binding properties. (2) Dependence on large-scale or scarce multimodal protein datasets demands significant training data and computational resources, limiting scalability and efficiency. To address these challenges, we propose a novel approach that pretrains protein representations for CPI prediction tasks using subsequence reordering, explicitly capturing the dependencies between protein subsequences. Furthermore, we apply length-variable protein augmentation to ensure excellent pretraining performance on small training datasets. To evaluate the model's effectiveness and zero-shot learning ability, we combine it with various baseline methods. The results demonstrate that our approach can improve the baseline model's performance on the CPI task, especially in the challenging zero-shot scenario. Compared to existing pre-training models, our model demonstrates superior performance, particularly in data-scarce scenarios where training samples are limited. Our implementation is available at https://github.com/Hoch-Zhang/PSRP-CPI.
Modeling User Behavior from Adaptive Surveys with Supplemental Context
Shukla, Aman, Scantlebury, Daniel Patrick, Kumar, Rishabh
Modeling user behavior is critical across many industries where understanding preferences, intent, or decisions informs personalization, targeting, and strategic outcomes. Surveys have long served as a classical mechanism for collecting such behavioral data due to their interpretability, structure, and ease of deployment. However, surveys alone are inherently limited by user fatigue, incomplete responses, and practical constraints on their length making them insufficient for capturing user behavior. In this work, we present LANTERN (Late-Attentive Network for Enriched Response Modeling), a modular architecture for modeling user behavior by fusing adaptive survey responses with supplemental contextual signals. We demonstrate the architectural value of maintaining survey primacy through selective gating, residual connections and late fusion via cross-attention, treating survey data as the primary signal while incorporating external modalities only when relevant. LANTERN outperforms strong survey-only baselines in multi-label prediction of survey responses. We further investigate threshold sensitivity and the benefits of selective modality reliance through ablation and rare/frequent attribute analysis. LANTERN's modularity supports scalable integration of new encoders and evolving datasets. This work provides a practical and extensible blueprint for behavior modeling in survey-centric applications.