Unlearning specific concepts in text-to-image diffusion models has become increasingly important for preventing undesirable content generation. Among prior approaches, sparse autoencoder (SAE)-based methods have attracted attention due to their ability to suppress target concepts through lightweight manipulation of lat...
Hyeonjin Kim, Hangyeol Jung, Heechan Yun et al.· 0 citations
Machine Learning Interatomic Potentials play a fundamental role in computational chemistry and materials science, enabling applications from molecular dynamics simulations to drug design and materials discovery. While recent approaches can estimate inter-atomic forces with high precision, it remains unclear to what ext...
Amir Masoud Nourollah, Irtaza Khalid, Stefano Leoni et al.· 0 citations
Unsupervised pretraining has driven empirical advances in goal-conditioned reinforcement learning (GCRL), but its theoretical foundations remain poorly understood. In particular, an influential class of methods, mutual information skill learning (MISL), discovers behaviorally diverse skills that can later be used for d...
Alireza Modirshanechi, Benjamin Eysenbach, Peter Dayan et al.· 0 citations
We investigate whether an explicit learned memory graph can replace the Feed-Forward Network (FFN) sublayer in a decoder-only transformer while preserving the surrounding autoregressive architecture. In the proposed graph Memory Transformer (GMT), a memory cell routes token representations over a learned bank of centro...
Existing evaluation methods largely rely on clean, static benchmarks, which can overestimate true model performance by failing to capture the noise and variability inherent in real-world user inputs. This is especially true for language models, which can face human-generated text queries containing mistakes, typos, or...
Angelika Romanou, Mark Ibrahim, Candace Ross et al.· 0 citations
On-policy agents discard trajectories after each update, including rare high-return episodes. We propose Optimistic Policy Regularization (OPR), which turns those episodes into a closed-form reward bonus: we estimate an elite action prior from top-quartile episodes and add a \reviewblue{bounded transform of the log-rat...
Recent studies have shown that reinforcement learning with KL-regularized objectives can enjoy faster rates of convergence or logarithmic regret, in contrast to the classical $\sqrt{T}$-type regret in the unregularized setting. However, the statistical efficiency of online learning with respect to KL-regularized object...
Kaixuan Ji, Qingyue Zhao, Heyang Zhao et al.· 0 citations
A hybrid Benders solver with output-sensitive iteration bounds is developed, leveraging a Helly-based conflict compression theory to avoid generic exponential cut explosion and establishes an unconditionally polynomial Benders iteration complexity in network size.
Wen-Xin Li, Wen-Chao Liu, An-Zhe Jiang et al.· 0 citations
MarkTune is introduced, a theoretically grounded on-policy fine-tuning framework that uses the GaussMark detection statistic as a reward while preserving generation quality through cross-entropy on high-quality human text or KL divergence to a stronger oracle model.
Yi-Zhou Zhao, Zhiwei Steven Wu, Adam Block· 0 citations
An adversarial game in which the discriminator tightens this bound and the generator maximizes it is formulated, and it is shown that, under balanced class priors, the population game is equivalent to minimizing total variation between the data and generator distributions.
Mohammadreza Tavasoli Naeini, Ali Bereyhi, Morteza Noshad et al.· 0 citations
Reliable value estimation serves as the cornerstone of reinforcement learning (RL) by evaluating long-term returns and guiding policy improvement, significantly influencing the convergence speed and final performance. Existing works improve the reliability of value function estimation via multi-critic ensembles and dis...
Shan Zhong, Shutong Ding, He Diao et al.· 0 citations
This work shows that, when there is a quadratic gap in computational resources between attacker and defender, every learnable classification task admits either a transferable attack or an adversarial defense, and proves a stronger result that implies this failure.
Greg Gluch, S. Goldwasser, Anastasiia Struss· 1 citation