activity
20212026
most citedDifferentially Private Federated Bayesian Optimization with Distributed Exploration

5 citations · 37 across the 41 of their papers we have counts for

collaborators
Showing 2024Show all

8 papers · 1 filter

cs.GT2024

Near-Optimal Mechanisms for Resource Allocation Without Monetary Transfers

Moïse Blanchard, Patrick Jaillet

We study the problem in which a central planner sequentially allocates a single resource to multiple strategic agents using their utility reports at each round, but without using a…

cs.LG2024

Neural Dueling Bandits: Preference-Based Optimization with Human Feedback

Arun Verma, Zhongxiang Dai, Xiaoqiang Lin +2

Contextual dueling bandit is used to model the bandit problems, where a learner's goal is to find the best arm for a given context using observed noisy human preference feedback ov…

cs.LG2024

A Universal Class of Sharpness-Aware Minimization Algorithms

Behrooz Tahmasebi, Ashkan Soleymani, Dara Bahri +2

Recently, there has been a surge in interest in developing optimization algorithms for overparameterized models as achieving generalization is believed to require algorithms with s…

cs.LG2024★ 3 cited

Prompt Optimization with Human Feedback

Xiaoqiang Lin, Zhongxiang Dai, Arun Verma +3

Large language models (LLMs) have demonstrated remarkable performances in various tasks. However, the performance of LLMs heavily depends on the input prompt, which has given rise…

cs.AI2024★ 3 cited

Prompt Optimization with EASE? Efficient Ordering-aware Automated Selection of Exemplars

Zhaoxuan Wu, Xiaoqiang Lin, Zhongxiang Dai +5

Large language models (LLMs) have shown impressive capabilities in real-world applications. The capability of in-context learning (ICL) allows us to adapt an LLM to downstream task…

cs.LG2024★ 1 cited

Incentives in Private Collaborative Machine Learning

Rachael Hwee Ling Sim, Yehong Zhang, Trong Nghia Hoang +3

Collaborative machine learning involves training models on data from multiple parties but must incentivize their participation. Existing data valuation methods fairly value and rew…

math.OC2024★ 3 cited

When Should you Offer an Upgrade: Online Upgrading Mechanisms for Resource Allocation

Patrick Jaillet, Chara Podimata, Andrew Vakhutinsky +1

In this work, we study an upgrading scheme for online resource allocation problems. We work in a sequential setting, where at each round a request for a resource arrives and the de…

cs.GT2024

Grace Period is All You Need: Individual Fairness without Revenue Loss in Revenue Management

Patrick Jaillet, Chara Podimata, Zijie Zhou

Imagine you and a friend purchase identical items at a store, yet only your friend received a discount. Would your friend's discount make you feel unfairly treated by the store? An…