0

Concept Algebra for Text-Controlled Vision Models

This paper concerns the control of text-guided generative models, where a user provides a natural language prompt and the model generates samples based on this input. Prompting is intuitive, general, and flexible. However, there are significant …

Relaxing the i.i.d. assumption: Adaptively minimax optimal regret via root-entropic regularization

We consider prediction with expert advice when data are generated from distributions varying arbitrarily within an unknown constraint set. This semi-adversarial setting includes (at the extremes) the classical i.i.d. setting, when the unknown …

Tuning Stochastic Gradient Algorithms for Statistical Inference via Large-Sample Asymptotics

The tuning of stochastic gradient algorithms (SGAs) for optimization and sampling is often based on heuristics and trial-and-error rather than generalizable theory. We address this theory--practice gap by characterizing the large-sample statistical …

Optimal Scaling and Shaping of Random Walk Metropolis via Diffusion Limits of Block-IID Targets

This work extends Roberts et al. (1997) by considering limits of Random Walk Metropolis (RWM) applied to block IID target distributions, with corresponding block-independent proposals. The extension verifies the robustness of the optimal scaling …