Aranyak Mehta
7 papers · 2019–2026 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+3 more ↓ Show less ↑
π Cross-Pollinator (15) π Academic Marathon (6) π Conference Polyglot (4) π Renaissance Researcher (5) π Interdisciplinary Bridge
πΊοΈ
Taxonomy Completionist
(14)
π§
Keyword Pioneer
π₯
Mega-Team
(20)
Conferences
ICLR (2)
NIPS (2)
AAAI (1)
ALT (1)
EMNLP (1)
Top co-authors
Keywords
monotone hazard rate
(2)
mechanism design
(1)
nash equilibrium
(1)
subset selection
(1)
no-regret learning
(1)
greedy algorithm
(1)
learning algorithm
(1)
approximation algorithm
(1)
repeated auction
(1)
welfare maximization
(1)
no-regret algorithm
(1)
noisy observation
(1)
parameter-efficient finetuning
(1)
coarse correlated equilibrium
(1)
probabilistic analysis
(1)
price of anarchy
(1)
auction theory
(1)
deep q-learning
(1)
inference time
(1)
multi-task training
(1)
Papers
Reward Selection with Noisy Observations
ALT 2026
Linear Transformer Topological Masking with Graph Random Features
ICLR 2025
Conditional Language Policy: A General Framework For Steerable Multi-Objective Finetuning
EMNLP 2024
Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions
NIPS 2022
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions
AAAI 2021
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics
NIPS 2020
A new dog learns old tricks: RL finds classic optimization algorithms
ICLR 2019