Processing math: 100%
Skip to yearly menu bar Skip to main content


Search All 2022 Events
 

9 Results

<<   <   Page 1 of 1   >>   >
Workshop
Statistical and Computational Complexities of BFGS Quasi-Newton Method for Generalized Linear Models
Qiujiang Jin · Aryan Mokhtari · Nhat Ho · Tongzheng Ren
Poster
Wed 14:00 Optimal Query Complexities for Dynamic Trace Estimation
David Woodruff · Fred Zhang · Richard Zhang
Poster
Wed 14:00 On the Sample Complexity of Stabilizing LTI Systems on a Single Trajectory
Yang Hu · Adam Wierman · Guannan Qu
Poster
Tue 14:00 Confident Approximate Policy Iteration for Efficient Local Planning in qπ-realizable MDPs
Gellért Weisz · András György · Tadashi Kozuno · Csaba Szepesvari
Poster
Wed 14:00 Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity
Sally Dong · Haotian Jiang · Yin Tat Lee · Swati Padmanabhan · Guanghao Ye
Poster
Tue 9:00 EcoFormer: Energy-Saving Attention with Linear Complexity
Jing Liu · Zizheng Pan · Haoyu He · Jianfei Cai · Bohan Zhuang
Poster
Wed 9:00 On the Statistical Efficiency of Reward-Free Exploration in Non-Linear RL
Jinglin Chen · Aditya Modi · Akshay Krishnamurthy · Nan Jiang · Alekh Agarwal
Poster
Tue 14:00 Submodular Maximization in Clean Linear Time
Wenxin Li · Moran Feldman · Ehsan Kazemi · Amin Karbasi
Poster
Thu 9:00 Improved Bounds on Neural Complexity for Representing Piecewise Linear Functions
Kuan-Lin Chen · Harinath Garudadri · Bhaskar D Rao