activity
20242026
most citedArtificial Intelligence of Things: A Survey

75 citations · 76 across the 25 of their papers we have counts for

collaborators
Showing 2026Show all

11 papers · 1 filter

stat.ML2026

Score Mismatch and Set-Constrained Sampling in Zero-Shot Conditional Discrete Diffusion

Renxiang Huang, Yuchen Liang, Yingbin Liang +2

Discrete diffusion models have become a powerful framework for modeling complex discrete distributions across a range of applications. While theoretical convergence guarantees depe…

cs.DC2026

Communication-Aware Model Distributed Inference via Latent Representation Compression

Peyman Gholami, Theodoros-Thirimachos Davarakis, Teng Li +9

We study optimization of distributed model inference over resource-constrained edge resources. We propose a framework that optimizes the trade-off between model accuracy and commun…

cs.LG2026

Provably Efficient Personalized Multi-Objective Bandits with Proactive Conversational Queries

Linfeng Cao, Ming Shi, Ness B. Shroff

Personalized decision-making in multi-objective bandits requires learning user-specific trade-offs among competing objectives. Since arm utility depends on both unknown rewards and…

cs.LG2026

From Scores to Gibbs Correctors: Accelerating Uniform-Rate Discrete Diffusion Models

Yuchen Liang, Ness Shroff, Yingbin Liang

Discrete diffusion models have achieved strong empirical performance in text and other symbolic domains, but, especially for uniform-rate models, they often require many steps to g…

cs.LG2026

Regret Bounds for Reinforcement Learning from Multi-Source Imperfect Preferences

Ming Shi, Yingbin Liang, Ness B. Shroff +1

Reinforcement learning from human feedback (RLHF) replaces hard-to-specify rewards with pairwise trajectory preferences, yet regret-oriented theory often assumes that preference la…

cs.LG2026

An LP-based Sampling Policy for Multi-Armed Bandits with Side-Observations and Stochastic Availability

Ashutosh Soni, Peizhong Ju, Atilla Eryilmaz +1

We study the stochastic multi-armed bandit (MAB) problem where an underlying network structure enables side-observations across related actions. We use a bipartite graph to link ac…

cs.LG2026

Escaping Offline Pessimism: Vector-Field Reward Shaping for Safe Frontier Exploration

Amirhossein Roknilamouki, Arnob Ghosh, Eylem Ekici +1

While offline reinforcement learning provides reliable policies for real-world deployment, its inherent pessimism severely restricts an agent's ability to explore and collect novel…

cs.LG2026

Sharp Convergence Rates for Masked Diffusion Models

Yuchen Liang, Zhiheng Tan, Ness Shroff +1

Discrete diffusion models have achieved strong empirical performance in text and other symbolic domains, with masked (absorbing-rate) variants emerging as competitive alternatives…

cs.LG2026

Provable Last-Iterate Convergence for Multi-Objective Safe LLM Alignment via Optimistic Primal-Dual

Yining Li, Peizhong Ju, Ness Shroff

Reinforcement Learning from Human Feedback (RLHF) plays a significant role in aligning Large Language Models (LLMs) with human preferences. While RLHF with expected reward constrai…

cs.LG2026

Constraint-Rectified Training for Efficient Chain-of-Thought

Qinhang Wu, Sen Lin, Ming Zhang +2

Chain-of-Thought (CoT) has significantly enhanced the reasoning capabilities of Large Language Models (LLMs), especially when combined with reinforcement learning (RL) based post-t…

cs.LG2026

Learnable Chernoff Baselines for Inference-Time Alignment

Sunil Madhow, Yuchen Liang, Ness Shroff +2

We study inference-time reward-guided alignment for generative models. Existing methods often rely on either architecture-specific adaptations or computationally costly inference p…