( en | de | ru )

 

Disambiguation of "Liaw, Christopher"

Author of the publication

copydeleteadd this publication to your clipboard
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions.

, , , , and . CoRR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yih-nan Liaw

Corvin Liaw

Liaw Kim Kiat

Jing-Yunn Liaw

Tsong-Ming Liaw

 

Other publications of authors with the same name

The Value of Information Concealment., , , and . SODA, page 2533-2544. SIAM, (2018)Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions., , , , and . AAAI, page 5399-5406. AAAI Press, (2021)Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples., , and . ALT, volume 237 of Proceedings of Machine Learning Research, page 47-73. PMLR, (2024)User Response in Ad Auctions: An MDP Formulation of Long-term Revenue Optimization., , , , and . WWW, page 111-122. ACM, (2024)Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions., , , , and . CoRR, (2020)Approximation Schemes for Covering and Packing in the Streaming Model., , and . CoRR, (2017)Optimal anytime regret with two experts., , , and . CoRR, (2020)Polynomial Time and Private Learning of Unbounded Gaussian Mixture Models., , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 1018-1040. PMLR, (2023)Improved Online Learning Algorithms for CTR Prediction in Ad Auctions., , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 9921-9937. PMLR, (2023)Optimal anytime regret for two experts., , , and . FOCS, page 1404-1415. IEEE, (2020)