5 papers
Learning-Enabled Estimation: Tight Characterizations under Sample Selection Biases
Vikram Kher, Jane H. Lee, Anay Mehrotra +1
When can we learn from biased samples? We study regression when outcomes are observed only after passing through selection filters that depend on both covariates and outcomes thems…
Risk-Averse Constrained Reinforcement Learning with Optimized Certainty Equivalents
Jane H. Lee, Baturay Saglam, Spyridon Pougkakiotis +2
Constrained optimization provides a common framework for dealing with conflicting objectives in reinforcement learning (RL). In most of these settings, the objectives (and constrai…
Massive Memorization with Hundreds of Trillions of Parameters for Sequential Transducer Generative Recommenders
Zhimin Chen, Chenyu Zhao, Ka Chun Mo +7
Modern large-scale recommendation systems rely heavily on user interaction history sequences to enhance the model performance. The advent of large language models and sequential mo…
Smoothed Analysis of Learning from Positive Samples
Jane H. Lee, Anay Mehrotra, Manolis Zampetakis
Binary classification from positive-only samples is a variant of PAC learning where the learner receives i.i.d. positive samples and aims to learn a classifier with low error. Prev…
Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
Jane H. Lee, Anay Mehrotra, Manolis Zampetakis
We study the estimation of distributional parameters when samples are shown only if they fall in some unknown set . Kontonis, Tzamos, and Zampetakis (FOCS…