:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Rezaei, Parham, Farnia, Farzan, Li, Cheuk Ting
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2412.17622
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

When Exploration Comes for Free with Mixture-Greedy: Do we need UCB in Diversity-Aware Multi-Armed Bandits?
by: Nia, Bahar Dibaei, et al.
Published: (2026)

DAK-UCB: Diversity-Aware Prompt Routing for LLMs and Generative Models
by: Jafari, Donya, et al.
Published: (2026)

PAK-UCB Contextual Bandit: An Online Learning Approach to Prompt-Aware Selection of Generative Models and LLMs
by: Hu, Xiaoyan, et al.
Published: (2024)

An Interpretable Evaluation of Entropy-based Novelty of Generative Models
by: Zhang, Jingwei, et al.
Published: (2024)

On the Hardness of Sampling from Mixture Distributions via Langevin Dynamics
by: Cheng, Xiwei, et al.
Published: (2024)

Exposing Diversity Bias in Deep Generative Models: Statistical Origins and Correction of Diversity Error
by: Farnia, Farzan, et al.
Published: (2026)

Unveiling Differences in Generative Models: A Scalable Differential Clustering Approach
by: Zhang, Jingwei, et al.
Published: (2024)

A Multi-Armed Bandit Approach to Online Selection and Evaluation of Generative Models
by: Hu, Xiaoyan, et al.
Published: (2024)

SPARKE: Scalable Prompt-Aware Diversity and Novelty Guidance in Diffusion Models via RKE Score
by: Jalali, Mohammad, et al.
Published: (2025)

Conditional Vendi Score: An Information-Theoretic Approach to Diversity Evaluation of Prompt-based Generative Models
by: Jalali, Mohammad, et al.
Published: (2024)

Clus-UCB: A Near-Optimal Algorithm for Clustered Bandits
by: Gore, Aakash, et al.
Published: (2025)

Certified Adversarial Robustness via Partition-based Randomized Smoothing
by: Goli, Hossein, et al.
Published: (2024)

Sparse Domain Transfer via Elastic Net Regularization
by: Zhang, Jingwei, et al.
Published: (2024)

Stability and Generalization in Free Adversarial Training
by: Cheng, Xiwei, et al.
Published: (2024)

Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)

On the Inductive Biases of Demographic Parity-based Fair Learning Algorithms
by: Lei, Haoyu, et al.
Published: (2024)

Do Vendi Scores Converge with Finite Samples? Truncated Vendi Score for Finite-Sample Convergence Guarantees
by: Ospanov, Azim, et al.
Published: (2024)

The Maximum von Neumann Entropy Principle: Theory and Applications in Machine Learning
by: Wu, Youqi, et al.
Published: (2026)

PromptSplit: Revealing Prompt-Level Disagreement in Generative Models
by: Lotfian, Mehdi, et al.
Published: (2026)

Risk-sensitive Bandits: Arm Mixture Optimality and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)

Gaussian Smoothing in Saliency Maps: The Stability-Fidelity Trade-Off in Neural Network Interpretability
by: Ye, Zhuorui, et al.
Published: (2024)

pFedFair: Towards Optimal Group Fairness-Accuracy Trade-off in Heterogeneous Federated Learning
by: Lei, Haoyu, et al.
Published: (2025)

A UCB Bandit Algorithm for General ML-Based Estimators
by: Liu, Yajing, et al.
Published: (2026)

On the Distributed Evaluation of Generative Models
by: Wang, Zixiao, et al.
Published: (2023)

Certifiably Robust Model Evaluation in Federated Learning under Meta-Distributional Shifts
by: Najafi, Amir, et al.
Published: (2024)

When Kernels Multiply, Clusters Unify: Fusing Embeddings with the Kronecker Product
by: Wu, Youqi, et al.
Published: (2025)

Cooperative Multi-Agent Graph Bandits: UCB Algorithm and Regret Analysis
by: Paschalidis, Phevos, et al.
Published: (2024)

Mixture of Diverse Size Experts
by: Sun, Manxi, et al.
Published: (2024)

Replicable Bandits with UCB based Exploration
by: Deb, Rohan, et al.
Published: (2026)

Boosting Cross-problem Generalization in Diffusion-Based Neural Combinatorial Solver via Inference Time Adaptation
by: Lei, Haoyu, et al.
Published: (2025)

PromptWise: Online Learning for Cost-Aware Prompt Assignment in Generative Models
by: Hu, Xiaoyan, et al.
Published: (2025)

An Information Theoretic Approach to Interaction-Grounded Learning
by: Hu, Xiaoyan, et al.
Published: (2024)

Interpretation of Neural Networks is Susceptible to Universal Adversarial Perturbations
by: Oskouie, Haniyeh Ehsani, et al.
Published: (2022)

Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
by: Li, Long-Fei, et al.
Published: (2024)

Truncated LinUCB for Stochastic Linear Bandits
by: Song, Yanglei, et al.
Published: (2022)

Training-Free Distribution Adaptation for Diffusion Models via Maximum Mean Discrepancy Guidance
by: Sani, Matina Mahdizadeh, et al.
Published: (2026)

Sigmoid Gating is More Sample Efficient than Softmax Gating in Mixture of Experts
by: Nguyen, Huy, et al.
Published: (2024)

Mixture Compressor for Mixture-of-Experts LLMs Gains More
by: Huang, Wei, et al.
Published: (2024)

Towards a Scalable Reference-Free Evaluation of Generative Models
by: Ospanov, Azim, et al.
Published: (2024)

Improved Algorithms for Stochastic Linear Bandits Using Tail Bounds for Martingale Mixtures
by: Flynn, Hamish, et al.
Published: (2023)