activity
20212026
most citedIs Cosine-Similarity of Embeddings Really About Similarity?

133 citations · 282 across the 33 of their papers we have counts for

collaborators
Showing 2025Show all

15 papers · 1 filter

cs.LG2025

Efficient Inference for Inverse Reinforcement Learning and Dynamic Discrete Choice Models

Lars van der Laan, Aurélien Bibaut, Nathan Kallus

In many sequential decision-making problems, researchers observe actions but not the rewards that drive behavior, yet still wish to evaluate and compare counterfactual policies. In…

stat.ML2025

Soft Fitted Q-Iteration without Bellman Completeness: Occupancy Reweighting and Temperature Annealing

Lars van der Laan, Nathan Kallus

Fitted \(Q\)-iteration (FQI) is a standard regression-based method for optimal control in offline reinforcement learning, but its stability under function approximation often relie…

stat.ML2025

Fitted Q-Evaluation without Bellman Completeness via Occupancy Weighting

Lars van der Laan, Nathan Kallus

Fitted \(Q\)-evaluation (FQE) is a standard regression-based method for off-policy evaluation, but under distribution shift, value-function realizability alone does not ensure conv…

stat.ML2025

Bellman Calibration for -Learning in Offline Reinforcement Learning

Lars van der Laan, Nathan Kallus

Reliable long-horizon value prediction is difficult in offline reinforcement learning because fitted value methods combine bootstrapping, function approximation, and distribution s…

econ.GN2025

The Value of Personalized Recommendations: Evidence from Netflix

Kevin Zielnicki, Guy Aridor, Aurélien Bibaut +3

Personalized recommendation systems shape much of user choice online, yet their targeted nature makes separating out the value of recommendation and the underlying goods challengin…

cs.IR2025

Does Weighting Improve Matrix Factorization for Recommender Systems?

Alex Ayoub, Samuel Robertson, Dawen Liang +2

Matrix factorization is a widely used approach for top-N recommendation and collaborative filtering. When implemented on implicit feedback data (such as clicks), a common heuristic…

cs.IR2025

Rank-GRPO: Training LLM-based Conversational Recommender Systems with Reinforcement Learning

Yaochen Zhu, Harald Steck, Dawen Liang +4

Large language models (LLMs) are reshaping the recommender system paradigm by enabling users to express preferences and receive recommendations through conversations. Yet, aligning…

cs.LG2025

DiFFPO: Training Diffusion LLMs to Reason Fast and Furious via Reinforcement Learning

Hanyang Zhao, Dawen Liang, Wenpin Tang +2

We propose DiFFPO, Diffusion Fast and Furious Policy Optimization, a unified framework for training masked diffusion large language models (dLLMs) to reason not only better (furiou…

cs.LG2025

Inverse Reinforcement Learning with Just Classification and a Few Regressions

Lars van der Laan, Nathan Kallus, Aurelien Bibaut

Inverse reinforcement learning (IRL) aims to infer rewards from observed behavior, but rewards are not identified from the policy alone: many reward--value pairs can rationalize th…

stat.ME2025

Nonparametric Instrumental Variable Inference with Many Weak Instruments

Lars van der Laan, Nathan Kallus, Aurélien Bibaut

We study inference on linear functionals in the nonparametric instrumental variable (NPIV) problem with a discretely-valued instrument under a many-weak-instruments asymptotic regi…

cond-mat.str-el2025

Interacting Chern insulator transition on the sphere: revealing the Gross-Neveu-Yukawa criticality

Zhi-Qiang Gao, Taige Wang, Dung-Hai Lee

In two spatial dimensions, the transition between topological and trivial Chern insulators exemplifies a class of beyond-Landau critical phenomena. We show that the interaction-dri…

cs.IR2025

Collaborative Retrieval for Large Language Model-based Conversational Recommender Systems

Yaochen Zhu, Chao Wan, Harald Steck +4

Conversational recommender systems (CRS) aim to provide personalized recommendations via interactive dialogues with users. While large language models (LLMs) enhance CRS with their…

stat.ME2025★ 1 cited

Evaluating Decision Rules Across Many Weak Experiments

Winston Chou, Colin Gray, Nathan Kallus +2

Technology firms conduct randomized controlled experiments ("A/B tests") to learn which actions to take to improve business outcomes. In firms with mature experimentation platforms…

stat.ME2025

Automatic Debiased Machine Learning for Smooth Functionals of Nonparametric M-Estimands

Lars van der Laan, Aurelien Bibaut, Nathan Kallus +1

We develop a unified framework for automatic debiased machine learning (autoDML) for inference on a broad class of statistical parameters. The framework applies to any smooth funct…

stat.ML2025

Semiparametric Double Reinforcement Learning with Applications to Long-Term Causal Inference

Lars van der Laan, David Hubbard, Allen Tran +2

Double reinforcement learning (DRL) provides efficient off-policy inference for policy values in nonparametric Markov decision processes (MDPs), but fully nonparametric estimators…