activity
20192025
most citedAn Efficient -BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization

2 citations · 3 across the 11 of their papers we have counts for

collaborators

11 papers

stat.ML2025

Prediction-Augmented Trees for Reliable Statistical Inference

Vikram Kher, Argyris Oikonomou, Manolis Zampetakis

The remarkable success of machine learning (ML) in predictive tasks has led scientists to incorporate ML predictions as a core component of the scientific discovery pipeline. This…

cs.LG2024

Provable Partially Observable Reinforcement Learning with Privileged Information

Yang Cai, Xiangyu Liu, Argyris Oikonomou +1

Partial observability of the underlying states generally presents significant challenges for reinforcement learning (RL). In practice, certain \emph{privileged information}, e.g.,…

cs.LG2024★ 1 cited

COMAL: A Convergent Meta-Algorithm for Aligning LLMs with General Preferences

Yixin Liu, Argyris Oikonomou, Weiqiang Zheng +2

Many alignment methods, including reinforcement learning from human feedback (RLHF), rely on the Bradley-Terry reward assumption, which is not always sufficient to capture the full…

cs.LG2024

Injecting Undetectable Backdoors in Obfuscated Neural Networks and Language Models

Alkis Kalavasis, Amin Karbasi, Argyris Oikonomou +3

As ML models become increasingly complex and integral to high-stakes domains such as finance and healthcare, they also become more susceptible to sophisticated adversarial attacks.…

cs.GT2024

Dynamics and Contracts for an Agent with Misspecified Beliefs

Yingkai Li, Argyris Oikonomou

We study a single-agent contracting environment where the agent has misspecified beliefs about the outcome distributions for each chosen action. First, we show that for a myopic Ba…

math.OC2023

Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation

Yang Cai, Michael I. Jordan, Tianyi Lin +2

Equilibrium computation on Riemannian manifolds provides a unifying framework for numerous problems in machine learning and data analytics. One of the simplest yet most fundamental…

math.OC2022

Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion

Yang Cai, Argyris Oikonomou, Weiqiang Zheng

We study constrained comonotone min-max optimization, a structured class of nonconvex-nonconcave min-max optimization problems, and their generalization to comonotone inclusion. In…

math.OC2022

Tight Last-Iterate Convergence of the Extragradient and the Optimistic Gradient Descent-Ascent Algorithm for Constrained Monotone Variational Inequalities

Yang Cai, Argyris Oikonomou, Weiqiang Zheng

The monotone variational inequality is a central problem in mathematical programming that unifies and generalizes many important settings such as smooth convex optimization, two-pl…

cs.GT2021

Computing Simple Mechanisms: Lift-and-Round over Marginal Reduced Forms

Yang Cai, Argyris Oikonomou, Mingfei Zhao

We study revenue maximization in multi-item multi-bidder auctions under the natural item-independence assumption - a classical problem in Multi-Dimensional Bayesian Mechanism Desig…

cs.GT2021

On Simple Mechanisms for Dependent Items

Yang Cai, Argyris Oikonomou

We study the problem of selling heterogeneous items to a single buyer, whose values for different items are dependent. Under arbitrary dependence, Hart and Nisan show that no s…

cs.GT2019★ 2 cited

An Efficient -BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization

Yang Cai, Argyris Oikonomou, Grigoris Velegkas +1

We consider the black-box reduction from multi-dimensional revenue maximization to virtual welfare maximization. Cai et al. show a polynomial-time approximation-preserving reductio…