Christopher Liaw

Follow

Generating author description...

All published works
Action Title Year Authors
+ On the expected <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e22" altimg="si9.svg"><mml:msub><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mi>∞</mml:mi></mml:mrow></mml:msub></mml:math>-norm of high-dimensional martingales 2025 Nicholas J. A. Harvey
Christopher Liaw
Victor Sanches Portella
+ PDF Chat Auto-bidding and Auctions in Online Advertising: A Survey 2024 Gagan Aggarwal
Ashwinkumar Badanidiyuru
Santiago Balseiro
Kshipra Bhawalkar
Yuan Deng
Zhe Feng
Gagan Goel
Christopher Liaw
Haihao Lu
Mohammad Mahdian
+ PDF Chat Agnostic Private Density Estimation via Stable List Decoding 2024 Mohammad Afzali
Hassan Ashtiani
Christopher Liaw
+ The Power of Two-Sided Recruitment in Two-Sided Markets 2024 Yang Cai
Christopher Liaw
Aranyak Mehta
Mingfei Zhao
+ PDF Chat Auto-Bidding and Auctions in Online Advertising: A Survey 2024 Gagan Aggarwal
Ashwinkumar Badanidiyuru
Santiago Balseiro
Kshipra Bhawalkar
Yuan Deng
Zhe Feng
Gagan Goel
Christopher Liaw
Haihao Lu
Mohammad Mahdian
+ PDF Chat Efficiency of Non-Truthful Auctions in Auto-bidding with Budget Constraints 2024 Christopher Liaw
Aranyak Mehta
Wennan Zhu
+ PDF Chat User Response in Ad Auctions: An MDP Formulation of Long-term Revenue Optimization 2024 Yang Cai
Zhe Feng
Christopher Liaw
Aranyak Mehta
Grigoris Velegkas
+ PDF Chat Improved Online Learning Algorithms for CTR Prediction in Ad Auctions 2024 Zhe Feng
Christopher Liaw
Zixin Zhou
+ PDF Chat Optimal anytime regret with two experts 2023 Nicholas J. A. Harvey
Christopher Liaw
Edwin Perkins
Sikander Randhawa
+ User Response in Ad Auctions: An MDP Formulation of Long-Term Revenue Optimization 2023 Yang Cai
Zhe Chuan Feng
Christopher Liaw
Aranyak Mehta
+ Polynomial Time and Private Learning of Unbounded Gaussian Mixture Models 2023 Jamil Arbas
Hassan Ashtiani
Christopher Liaw
+ The Power of Two-sided Recruitment in Two-sided Markets 2023 Yang Cai
Christopher Liaw
Aranyak Mehta
Mingfei Zhao
+ Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples 2023 Mohammad Afzali
Hassan Ashtiani
Christopher Liaw
+ Efficiency of Non-Truthful Auctions in Auto-bidding with Budget Constraints 2023 Christopher Liaw
Aranyak Mehta
Wennan Zhu
+ Efficiency of non-truthful auctions under auto-bidding 2022 Christopher Liaw
Aranyak Mehta
Andrés Perlroth
+ Continuous Prediction with Experts' Advice 2022 Victor Sanches Portella
Christopher Liaw
Nicholas J. A. Harvey
+ Privately Learning Mixtures of Axis-Aligned Gaussians 2021 Ishaq Aden-Ali
Hassan Ashtiani
Christopher Liaw
+ Private and polynomial time algorithms for learning Gaussians and beyond. 2021 Hassan Ashtiani
Christopher Liaw
+ Privately Learning Mixtures of Axis-Aligned Gaussians 2021 Ishaq Aden-Ali
Hassan Ashtiani
Christopher Liaw
+ PDF Chat Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions 2021 Zhe Feng
Guru Guruganesh
Christopher Liaw
Aranyak Mehta
Abhishek Sethi
+ Private and polynomial time algorithms for learning Gaussians and beyond 2021 Hassan Ashtiani
Christopher Liaw
+ Privately Learning Mixtures of Axis-Aligned Gaussians 2021 Ishaq Aden-Ali
Hassan Ashtiani
Christopher Liaw
+ PDF Chat Optimal anytime regret for two experts 2020 Nicholas J. A. Harvey
Christopher Liaw
Edwin Perkins
Sikander Randhawa
+ Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions 2020 Zhe Feng
Guru Guruganesh
Christopher Liaw
Aranyak Mehta
Abhishek Sethi
+ Optimal anytime regret with two experts 2020 Nicholas J. A. Harvey
Christopher Liaw
Edwin Perkins
Sikander Randhawa
+ Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent 2019 Nicholas J. A. Harvey
Christopher Liaw
Sikander Randhawa
+ Tight analyses for non-smooth stochastic gradient descent 2019 Nicholas J. A. Harvey
Christopher Liaw
Yaniv Plan
Sikander Randhawa
+ PDF Chat The Vickrey Auction with a Single Duplicate Bidder Approximates the Optimal Revenue 2019 Hu Fu
Christopher Liaw
Sikander Randhawa
+ The Vickrey Auction with a Single Duplicate Bidder Approximates the Optimal Revenue 2019 Hu Fu
Christopher Liaw
Sikander Randhawa
+ Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent 2019 Nicholas J. A. Harvey
Christopher Liaw
Sikander Randhawa
+ PDF Chat Greedy and Local Ratio Algorithms in the MapReduce Model 2018 Nicholas J. A. Harvey
Christopher Liaw
Paul Liu
+ PDF Chat The Value of Information Concealment 2018 Hu Fu
Christopher Liaw
Pinyan Lu
Zhihao Gavin Tang
+ Tight Analyses for Non-Smooth Stochastic Gradient Descent 2018 Nicholas J. A. Harvey
Christopher Liaw
Yaniv Plan
Sikander Randhawa
+ Greedy and Local Ratio Algorithms in the MapReduce Model 2018 Nicholas J. A. Harvey
Christopher Liaw
Paul Liu
+ Settling the Sample Complexity for Learning Mixtures of Gaussians 2017 Hassan Ashtiani
Shai Ben-David
Nick Harvey
Christopher Liaw
Abbas Mehrabian
Yaniv Plan
+ Tight Load Balancing via Randomized Local Search 2017 Petra Berenbrink
Peter Kling
Christopher Liaw
Abbas Mehrabian
+ PDF Chat Tight Load Balancing Via Randomized Local Search 2017 Petra Berenbrink
Peter Kling
Christopher Liaw
Abbas Mehrabian
+ Rainbow Hamilton cycles and lopsidependency 2017 Nicholas C. Harvey
Christopher Liaw
+ PDF Chat A Simple Tool for Bounding the Deviation of Random Matrices on Geometric Sets 2017 Christopher Liaw
Abbas Mehrabian
Yaniv Plan
Roman Vershynin
+ Approximation Schemes for Covering and Packing in the Streaming Model 2017 Christopher Liaw
Paul Liu
Robert Reiss
+ Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians Mixtures via Compression Schemes 2017 Hassan Ashtiani
Shai Ben-David
Nick Harvey
Christopher Liaw
Abbas Mehrabian
Yaniv Plan
+ The Value of Information Concealment 2017 Hu Fu
Christopher Liaw
Pinyan Lu
Zhihao Gavin Tang
+ Tight Load Balancing via Randomized Local Search 2017 Petra Berenbrink
Peter Kling
Christopher Liaw
Abbas Mehrabian
+ A simple tool for bounding the deviation of random matrices on geometric sets 2016 Christopher Liaw
Abbas Mehrabian
Yaniv Plan
Roman Vershynin
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ High-Dimensional Probability: An Introduction with Applications in Data Science 2018 Roman Vershynin
5
+ PDF Chat Vickrey Auctions for Irregular Distributions 2013 Balasubramanian Sivan
Vasilis Syrgkanis
3
+ PDF Chat On the Hausdorff dimension of the Brownian slow points 1983 Edwin Perkins
3
+ PDF Chat Sampling from a Log-Concave Distribution with Projected Langevin Monte Carlo 2018 SĂ©bastien Bubeck
Ronen Eldan
Joseph Lehec
2
+ Robust Auction Design in the Auto-bidding World 2021 Santiago Balseiro
Yuan Deng
Jieming Mao
Vahab Mirrokni
Song Zuo
2
+ A method for Hedging in continuous time 2009 Yoav Freund
2
+ New Potential-Based Bounds for Prediction with Expert Advice 2019 Vladimir A. Kobzar
Robert V. Kohn
Zhilei Wang
2
+ PDF Chat A simpler approach to obtaining an O(1/t) convergence rate for the projected stochastic subgradient method 2012 Simon Lacoste-Julien
Mark Schmidt
Francis Bach
2
+ Tight Lower Bounds for Multiplicative Weights Algorithmic Families 2016 Nick Gravin
Yuval Peres
Balasubramanian Sivan
2
+ PDF Chat Introduction to the non-asymptotic analysis of random matrices 2012 Roman Vershynin
2
+ PDF Chat On the asymptotic optimality of the comb strategy for prediction with expert advice 2020 Erhan Bayraktar
Ibrahim Ekren
Yili Zhang
2
+ On the Sample Complexity of Privately Learning Unbounded High-Dimensional Gaussians. 2020 Ishaq Aden-Ali
Hassan Ashtiani
Gautam Kamath
2
+ PDF Chat Auction Design in an Auto-bidding Setting: Randomization Improves Efficiency Beyond VCG 2022 Aranyak Mehta
2
+ New Potential-Based Bounds for the Geometric-Stopping Version of Prediction with Expert Advice 2019 Vladimir A. Kobzar
Robert V. Kohn
Zhilei Wang
2
+ PDF Chat On Tail Probabilities for Martingales 1975 David A. Freedman
2
+ PDF Chat Econometrics for Learning Agents 2015 Denis Nekipelov
Vasilis Syrgkanis
Éva Tardos
2
+ Towards Minimax Online Learning with Unknown Time Horizon 2013 Haipeng Luo
Robert E. Schapire
2
+ PDF Chat Introduction to Online Convex Optimization 2016 Elad Hazan
2
+ PDF Chat Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems 2022 Sepehr Abbasi-Zadeh
Nikhil Bansal
Guru Guruganesh
Aleksandar Nikolov
Roy Schwartz
Mohit Singh
2
+ PDF Chat Prediction with Expert Advice: A PDE Perspective 2019 Nadejda Drenska
Robert V. Kohn
2
+ PDF Chat Learning to Bid Without Knowing your Value 2018 Zhe Feng
Chara Podimata
Vasilis Syrgkanis
2
+ PDF Chat 99% Revenue via Enhanced Competition 2018 Michal Feldman
Ophir Friedler
Aviad Rubinstein
2
+ Differentially Private Confidence Intervals 2020 Wenxin Du
Canyon Foot
Monica Moniot
Andrew Bray
Adam Groce
2
+ A Primer on Private Statistics 2020 Gautam Kamath
Jonathan Ullman
2
+ PDF Chat Optimal anytime regret for two experts 2020 Nicholas J. A. Harvey
Christopher Liaw
Edwin Perkins
Sikander Randhawa
2
+ PDF Chat Robust and Differentially Private Mean Estimation 2021 Xiyang Liu
Weihao Kong
Sham M. Kakade
Sewoong Oh
2
+ PDF Chat FIRST EXIT TIMES FROM A SQUARE ROOT BOUNDARY 1967 Leo Breiman
2
+ Probability 2019 Rick Durrett
2
+ PDF Chat Probability with Martingales 1991 David Williams
2
+ PDF Chat Finite-time 4-expert prediction problem 2020 Erhan Bayraktar
Ibrahim Ekren
Xin Zhang
2
+ PDF Chat A Conditioned Limit Theorem for Random Walk and Brownian Local Time on Square Root Boundaries 1983 Priscilla E. Greenwood
Edwin Perkins
2
+ PDF Chat On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms 2015 Philip N. Klein
Neal E. Young
2
+ PDF Chat Adaptive estimation of a quadratic functional by model selection 2000 BĂ©atrice Laurent
Pascal Massart
2
+ PDF Chat Minimax option pricing meets black-scholes in the limit 2012 Jacob Abernethy
Rafael Frongillo
Andre Wibisono
2
+ Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables 1965 D. B. Owen
Milton Abramowitz
Irene A. Stegun
2
+ Private Hypothesis Selection 2019 Mark Bun
Gautam Kamath
Thomas Steinke
Steven Z. Wu
2
+ Primal-dual subgradient methods for convex problems 2007 Yurii Nesterov
2
+ PDF Chat Correlated and Coarse Equilibria of Single-Item Auctions 2016 Michal Feldman
Brendan Lucier
Noam Nisan
2
+ Probability with martingales 1992 David N. Williams
2
+ Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile 2018 Panayotis Mertikopoulos
Bruno Lecouat
Houssam Zenati
Chuan-Sheng Foo
Vijay Chandrasekhar
Georgios Piliouras
2
+ Introduction to Nonparametric Estimation 2008 Alexandre B. Tsybakov
2
+ High-Dimensional Statistics: A Non-Asymptotic Viewpoint 2019 Martin J. Wainwright
2
+ A parameter-free hedging algorithm 2009 Kamalika Chaudhuri
Yoav Freund
Daniel Hsu
2
+ Krivine diffusions attain the Goemans--Williamson approximation ratio 2019 Ronen Eldan
Assaf Naor
2
+ Towards Optimal Algorithms for Prediction with Expert Advice 2015 Nick Gravin
Yuval Peres
Balasubramanian Sivan
2
+ PDF Chat Rainbow matchings and Hamilton cycles in random graphs 2015 Deepak Bal
Alan Frieze
1
+ Simple Bounds for Noisy Linear Inverse Problems with Exact Side Information 2013 Samet Oymak
Christos Thrampoulidis
Babak Hassibi
1
+ Convex analysis and minimization algorithms 1993 Jean‐Baptiste Hiriart‐Urruty
Claude Lemaréchal
1
+ High-dimensional estimation with geometric constraints 2014 Yaniv Plan
Roman Vershynin
Elena Yudovina
1
+ A Differential Equations Approach to Optimizing Regret Trade-offs 2013 Alexandr Andoni
Rina Panigrahy‎
1