Skip to content
conftrace_

AISTATS 2023

496 papers

Optimizing Pessimism in Dynamic Treatment Regimes: A Bayesian Learning Approach

Yunzhe Zhou, Zhengling Qi, Chengchun Shi, Lexin Li

Learning with Partial Forgetting in Modern Hopfield Networks

Toshihiro Ota, Ikuro Sato, Rei Kawakami, Masayuki Tanaka, Nakamasa Inoue

Efficient and Light-Weight Federated Learning via Asynchronous Distributed Dropout

Chen Dun, Mirian Hipolito, Chris Jermaine, Dimitrios Dimitriadis, Anastasios Kyrillidis

Scalable Spectral Clustering with Group Fairness Constraints

Ji Wang, Ding Lu, Ian Davidson, Zhaojun Bai

Provably Efficient Model-Free Algorithms for Non-stationary CMDPs

Honghao Wei, Arnob Ghosh, Ness Shroff, Lei Ying, Xingyu Zhou

LOFT: Finding Lottery Tickets through Filter-wise Training

Qihan Wang, Chen Dun, Fangshuo Liao, Chris Jermaine, Anastasios Kyrillidis

A stopping criterion for Bayesian optimization by the gap of expected minimum simple regrets

Hideaki Ishibashi, Masayuki Karasuyama, Ichiro Takeuchi, Hideitsu Hino

Distributionally Robust Policy Gradient for Offline Contextual Bandits

Zhouhao Yang, Yihong Guo, Pan Xu, Anqi Liu, Animashree Anandkumar

NODAGS-Flow: Nonlinear Cyclic Causal Structure Learning

Muralikrishnna G Sethuraman, Romain Lopez, Rahul Mohan, Faramarz Fekri, Tommaso Biancalani

Efficient Planning in Combinatorial Action Spaces with Applications to Cooperative Multi-Agent Reinforcement Learning

Volodymyr Tkachuk, Seyed Alireza Bakhtiari, Johannes Kirschner, Matej Jusup, Ilija Bogunovic

Generalization in Graph Neural Networks: Improved PAC-Bayesian Bounds on Graph Diffusion

Haotian Ju, Dongyue Li, Aneesh Sharma, Hongyang R. Zhang

Discrete Langevin Samplers via Wasserstein Gradient Flow

Haoran Sun, Hanjun Dai, Bo Dai, Haomin Zhou, Dale Schuurmans

Dueling RL: Reinforcement Learning with Trajectory Preferences

Aadirupa Saha, Aldo Pacchiano, Jonathan Lee

Nonstationary Bandit Learning via Predictive Sampling

Yueyang Liu, Benjamin Van Roy, Kuang Xu

Distill n’ Explain: explaining graph neural networks using simple surrogates

Tamara Pereira, Erik Nascimento, Lucas E. Resck, Diego Mesquita, Amauri Souza

Stochastic Tree Ensembles for Estimating Heterogeneous Effects

Nikolay Krantsevich, Jingyu He, P. Richard Hahn

Delayed Feedback in Generalised Linear Bandits Revisited

Benjamin Howson, Ciara Pike-Burke, Sarah Filippi

Optimism and Delays in Episodic Reinforcement Learning

Benjamin Howson, Ciara Pike-Burke, Sarah Filippi

Risk Bounds on Aleatoric Uncertainty Recovery

Yikai Zhang, Jiahe Lin, Fengpei Li, Yeshaya Adler, Kashif Rasul

Reinforcement Learning for Adaptive Mesh Refinement

Jiachen Yang, Tarik Dzanic, Brenden Petersen, Jun Kudo, Ketan Mittal

High Probability Bounds for Stochastic Continuous Submodular Maximization

Evan Becker, Jingdong Gao, Ted Zadouri, Baharan Mirzasoleiman

Stochastic Mirror Descent for Large-Scale Sparse Recovery

Sasila Ilandarideva, Yannis Bekri, Anatoli Iouditski, Vianney Perchet

Falsification of Internal and External Validity in Observational Studies via Conditional Moment Restrictions

Zeshan Hussain, Ming-Chieh Shih, Michael Oberst, Ilker Demirel, David Sontag

Cooperative Inverse Decision Theory for Uncertain Preferences

Zachary Robertson, Hantao Zhang, Sanmi Koyejo

Variational Boosted Soft Trees

Tristan Cinquin, Tammo Rukat, Philipp Schmidt, Martin Wistuba, Artur Bekasov

Private Non-Convex Federated Learning Without a Trusted Server

Andrew Lowy, Ali Ghafelebashi, Meisam Razaviyayn

Active Membership Inference Attack under Local Differential Privacy in Federated Learning

Truc Nguyen, Phung Lai, Khang Tran, NhatHai Phan, My T. Thai

A Contrastive Approach to Online Change Point Detection

Nikita Puchkin, Valeriia Shcherbakova

Boosted Off-Policy Learning

Ben London, Levi Lu, Ted Sandler, Thorsten Joachims

Faithful Heteroscedastic Regression with Neural Networks

Andrew Stirn, Harm Wessels, Megan Schertzer, Laura Pereira, Neville Sanjana

A Faster Sampler for Discrete Determinantal Point Processes

Simon Barthelmé, Nicolas Tremblay, Pierre-Olivier Amblard

TabLLM: Few-shot Classification of Tabular Data with Large Language Models

Stefan Hegselmann, Alejandro Buendia, Hunter Lang, Monica Agrawal, Xiaoyi Jiang

Is interpolation benign for random forest regression?

Ludovic Arnould, Claire Boyer, Erwan Scornet

Smoothly Giving up: Robustness for Simple Models

Tyler Sypherd, Nathaniel Stromberg, Richard Nock, Visar Berisha, Lalitha Sankar

Adversarial Random Forests for Density Estimation and Generative Modeling

David S. Watson, Kristin Blesch, Jan Kapar, Marvin N. Wright

Efficient fair PCA for fair representation learning

Matthäus Kleindessner, Michele Donini, Chris Russell, Muhammad Bilal Zafar

Manifold Restricted Interventional Shapley Values

Muhammad Faaiz Taufiq, Patrick Blöbaum, Lenon Minorics

Privacy-preserving Sparse Generalized Eigenvalue Problem

Lijie Hu, Zihang Xiang, Jiabin Liu, Di Wang

Bounding Evidence and Estimating Log-Likelihood in VAE

Łukasz Struski, Marcin Mazur, Paweł Batorski, Przemysław Spurek, Jacek Tabor

Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles

Yuxuan Han, Jialin Zeng, Yang Wang, Yang Xiang, Jiheng Zhang

Gaussian Processes on Distributions based on Regularized Optimal Transport

Francois Bachoc, Louis Béthune, Alberto Gonzalez-Sanz, Jean-Michel Loubes

Neural Simulated Annealing

Alvaro H.C. Correia, Daniel E. Worrall, Roberto Bondesan

High-Dimensional Private Empirical Risk Minimization by Greedy Coordinate Descent

Paul Mangold, Aurélien Bellet, Joseph Salmon, Marc Tommasi

A Sea of Words: An In-Depth Analysis of Anchors for Text Data

Gianluigi Lopardo, Frederic Precioso, Damien Garreau

Multi-task Representation Learning with Stochastic Linear Bandits

Leonardo Cella, Karim Lounici, Grégoire Pacreau, Massimiliano Pontil

Coordinate Descent for SLOPE

Johan Larsson, Quentin Klopfenstein, Mathurin Massias, Jonas Wallin

Approximating a RUM from Distributions on k-Slates

Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Alessandro Panconesi, Andrew Tomkins

Equivariant Representation Learning via Class-Pose Decomposition

Giovanni Luca Marchetti, Gustaf Tegnér, Anastasiia Varava, Danica Kragic

Computing Abductive Explanations for Boosted Trees

Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski

Feasible Recourse Plan via Diverse Interpolation

Duy Nguyen, Ngoc Bui, Viet Anh Nguyen

Neural Discovery of Permutation Subgroups

Pavan Karjol, Rohan Kashyap, Prathosh AP

Fair Representation Learning with Unreliable Labels

YIXUAN ZHANG, Feng Zhou, Zhidong Li, Yang Wang, Fang Chen

Mean Parity Fair Regression in RKHS

Shaokui Wei, Jiayin Liu, Bing Li, Hongyuan Zha

Isotropic Gaussian Processes on Finite Spaces of Graphs

Viacheslav Borovitskiy, Mohammad Reza Karimi, Vignesh Ram Somnath, Andreas Krause

Temporal Graph Neural Networks for Irregular Data

Joel Oskarsson, Per Sidén, Fredrik Lindsten

Learning Sparse Graphon Mean Field Games

Christian Fabian, Kai Cui, Heinz Koeppl

Distributed Offline Policy Optimization Over Batch Data

Han Shen, Songtao Lu, Xiaodong Cui, Tianyi Chen

Understanding Multimodal Contrastive Learning and Incorporating Unpaired Data

Ryumei Nakada, Halil Ibrahim Gulluk, Zhun Deng, Wenlong Ji, James Zou

Does Label Differential Privacy Prevent Label Inference Attacks?

Ruihan Wu, Jin Peng Zhou, Kilian Q. Weinberger, Chuan Guo

Piecewise Stationary Bandits under Risk Criteria

Sujay Bhatt, Guanhua Fang, Ping Li

The communication cost of security and privacy in federated frequency estimation

Wei-Ning Chen, Ayfer Ozgur, Graham Cormode, Akash Bharadwaj

Universal Agent Mixtures and the Geometry of Intelligence

Samuel Allen Alexander, David Quarel, Len Du, Marcus Hutter

Unsupervised representation learning with recognition-parametrised probabilistic models

William I. Walker, Hugo Soulat, Changmin Yu, Maneesh Sahani

On Universal Portfolios with Continuous Side Information

Alankrita Bhatt, J. Jon Ryu, Young-Han Kim