PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:NeurIPS (36. : 2022 : New Orleans, La.; Online) 36th Conference on Neural Information Processing Systems (NeurIPS 2022 ; Volume 4 of 50
1. Verfasser: Jang, Kyoungseok (VerfasserIn)
Weitere Verfasser: Zhang, Chicheng (VerfasserIn), Jun, Kwang-Sung (VerfasserIn)
Pages:36
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2023
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
What You See is What You Get: Principled Deep Learning via Distributional Generalization 2023 Kulynych, Bogdan
GAPX: Generalized Autoregressive Paraphrase-Identification X 2023 Zhou, Yifei
Monte Carlo Augmented Actor-Critic for Sparse Reward Deep Reinforcement Learning from Suboptimal Demonstrations 2023 Wilcox, Albert
Learning to Accelerate Partial Differential Equations via Latent Global Evolution 2023 Wu, Tailin
HumanLiker: A Human-like Object Detector to Model the Manual Labeling Process 2023 Wei, Haoran
DevFly: Bio-Inspired Development of Binary Connections for Locality Preserving Sparse Codes 2023 Wei, Tianqi
Efficiently Computing Local Lipschitz Constants of Neural Networks via Bound Propagation 2023 Shi, Zhouxing
Semi-Supervised Learning with Decision Trees: Graph Laplacian Tree Alternating Optimization 2023 Zharmagambetov, Arman
A Reduction to Binary Approach for Debiasing Multiclass Datasets 2023 Alabdulmohsin, Ibrahim M
Few-Shot Audio-Visual Learning of Environment Acoustics 2023 Majumder, Sagnik
The Phenomenon of Policy Churn 2023 Schaul, Tom
Towards Safe Reinforcement Learning with a Safety Editor Policy 2023 Yu, Haonan
Enhanced Meta Reinforcement Learning via Demonstrations in Sparse Reward Environments 2023 Rengarajan, Desik
Using Partial Monotonicity in Submodular Maximization 2023 Mualem, Loay
Semi-Supervised Semantic Segmentation via Gentle Teaching Assistant 2023 Jin, Ying
Generalization Bounds for Stochastic Gradient Descent via Localized ε-Covers 2023 Park, Sejun
Incrementality Bidding via Reinforcement Learning under Mixed and Delayed Rewards 2023 Badanidiyuru Varadaraja, Ashwinkumar
Scalable Infomin Learning 2023 Chen, Yanzhi
Not too little, not too much: a theoretical analysis of graph (over)smoothing 2023 Keriven, Nicolas
Kernel similarity matching with Hebbian networks 2023 Luther, Kyle
Alle Artikel auflisten