default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLucas Janson
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Wenshuo Wang, Lucas Janson, Lihua Lei, Aaditya Ramdas:
Total Variation Floodgate for Variable Importance Inference in Classification. ICML 2024- [i25]Biyonka Liang, Lily Xu, Aparna Taneja, Milind Tambe, Lucas Janson:
A Bayesian Approach to Online Learning for Contextual Restless Bandits with Applications to Public Health. CoRR abs/2402.04933 (2024) - [i24]Niclas Boehmer, Yash Nair, Sanket Shah, Lucas Janson, Aparna Taneja, Milind Tambe:
Evaluating the Effectiveness of Index-Based Treatment Allocation. CoRR abs/2402.11771 (2024) - [i23]Depen Morwani, Itai Shapira, Nikhil Vyas, Eran Malach, Sham M. Kakade, Lucas Janson:
A New Perspective on Shampoo's Preconditioner. CoRR abs/2406.17748 (2024) - [i22]Maximilian Li, Lucas Janson:
Optimal ablation for interpretability. CoRR abs/2409.09951 (2024) - [i21]Nikhil Vyas, Depen Morwani, Rosie Zhao, Itai Shapira, David Brandfonbrener, Lucas Janson, Sham M. Kakade:
SOAP: Improving and Stabilizing Shampoo using Adam. CoRR abs/2409.11321 (2024) - [i20]Benjamin Schiffer, Lucas Janson:
Stronger Regret Bounds for Safe Online Reinforcement Learning in the Linear Quadratic Regulator. CoRR abs/2410.21081 (2024) - 2023
- [c15]Feicheng Wang, Lucas Janson:
Rate-Matching the Regret Lower-Bound in the Linear Quadratic Regulator with Unknown Dynamics. CDC 2023: 536-541 - [i19]Thomas Lew, Riccardo Bonalli, Lucas Janson, Marco Pavone:
Estimating the convex hull of the image of a set with smooth boundary: error bounds and applications. CoRR abs/2302.13970 (2023) - 2022
- [c14]Alexander Koenig, Zixi Liu
, Lucas Janson, Robert D. Howe:
The Role of Tactile Sensing in Learning and Deploying Grasp Refinement Algorithms. IROS 2022: 7766-7772 - [c13]Thomas Lew, Lucas Janson, Riccardo Bonalli, Marco Pavone:
A Simple and Efficient Sampling-based Algorithm for General Reachability Analysis. L4DC 2022: 1086-1099 - [i18]Feicheng Wang, Lucas Janson:
Rate-matching the regret lower-bound in the linear quadratic regulator with unknown dynamics. CoRR abs/2202.05799 (2022) - [i17]Kelly W. Zhang, Lucas Janson, Susan A. Murphy:
Statistical Inference After Adaptive Sampling in Non-Markovian Environments. CoRR abs/2202.07098 (2022) - 2021
- [j5]Feicheng Wang, Lucas Janson:
Exact Asymptotics for Linear Quadratic Adaptive Control. J. Mach. Learn. Res. 22: 265:1-265:112 (2021) - [j4]Siyuan Ma, Boyu Ren, Himel Mallick, Yo Sup Moon, Emma H. Schwager, Sagun Maharjan, Timothy L. Tickle, Yiren Lu, Rachel N. Carmody, Eric A. Franzosa, Lucas Janson, Curtis Huttenhower:
A statistical model for describing and simulating microbial community profiles. PLoS Comput. Biol. 17(9) (2021) - [c12]Kelly W. Zhang, Lucas Janson, Susan A. Murphy:
Statistical Inference with M-Estimators on Adaptively Collected Data. NeurIPS 2021: 7460-7471 - [i16]Kelly W. Zhang, Lucas Janson, Susan A. Murphy:
Statistical Inference with M-Estimators on Bandit Data. CoRR abs/2104.14074 (2021) - [i15]Alexander Koenig, Zixi Liu, Lucas Janson, Robert D. Howe:
Tactile Grasp Refinement using Deep Reinforcement Learning and Analytic Grasp Stability Metrics. CoRR abs/2109.11234 (2021) - [i14]Thomas Lew, Lucas Janson, Riccardo Bonalli, Marco Pavone:
A Simple and Efficient Sampling-based Algorithm for General Reachability Analysis. CoRR abs/2112.05745 (2021) - 2020
- [c11]Kiril Solovey, Lucas Janson, Edward Schmerling, Emilio Frazzoli, Marco Pavone:
Revisiting the Asymptotic Optimality of RRT. ICRA 2020: 2189-2195 - [c10]Amine Elhafsi, Boris Ivanovic, Lucas Janson, Marco Pavone:
Map-Predictive Motion Planning in Unknown Environments. ICRA 2020: 8552-8558 - [c9]Pierre Bayle, Alexandre Bayle, Lucas Janson, Lester Mackey:
Cross-validation Confidence Intervals for Test Error. NeurIPS 2020 - [c8]Kelly W. Zhang, Lucas Janson, Susan A. Murphy:
Inference for Batched Bandits. NeurIPS 2020 - [i13]Kelly W. Zhang, Lucas Janson, Susan A. Murphy:
Inference for Batched Bandits. CoRR abs/2002.03217 (2020) - [i12]Pierre Bayle, Alexandre Bayle, Lucas Janson, Lester Mackey:
Cross-validation Confidence Intervals for Test Error. CoRR abs/2007.12671 (2020) - [i11]Feicheng Wang, Lucas Janson:
Exact Asymptotics for Linear Quadratic Adaptive Control. CoRR abs/2011.01364 (2020)
2010 – 2019
- 2019
- [i10]Kiril Solovey, Lucas Janson, Edward Schmerling, Emilio Frazzoli, Marco Pavone:
Revisiting the Asymptotic Optimality of RRT. CoRR abs/1909.09688 (2019) - [i9]Amine Elhafsi, Boris Ivanovic, Lucas Janson, Marco Pavone:
Map-Predictive Motion Planning in Unknown Environments. CoRR abs/1910.08184 (2019) - 2018
- [j3]Lucas Janson, Brian Ichter, Marco Pavone:
Deterministic sampling-based motion planning: Optimality, complexity, and performance. Int. J. Robotics Res. 37(1): 46-61 (2018) - [c7]Lucas Janson, Tommy Hu, Marco Pavone:
Safe Motion Planning in Unknown Environments: Optimality Benchmarks and Tractable Policies. Robotics: Science and Systems 2018 - [i8]Lucas Janson, Tommy Hu, Marco Pavone:
Safe Motion Planning in Unknown Environments: Optimality Benchmarks and Tractable Policies. CoRR abs/1804.05804 (2018) - 2017
- [j2]Yinlam Chow, Mohammad Ghavamzadeh, Lucas Janson, Marco Pavone:
Risk-Constrained Reinforcement Learning with Percentile Risk Criteria. J. Mach. Learn. Res. 18: 167:1-167:51 (2017) - 2015
- [j1]Lucas Janson, Edward Schmerling, Ashley A. Clark, Marco Pavone:
Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions. Int. J. Robotics Res. 34(7): 883-921 (2015) - [c6]Edward Schmerling, Lucas Janson, Marco Pavone:
Optimal sampling-based motion planning under differential constraints: The drift case with linear affine dynamics. CDC 2015: 2574-2581 - [c5]Edward Schmerling, Lucas Janson, Marco Pavone:
Optimal sampling-based motion planning under differential constraints: The driftless case. ICRA 2015: 2368-2375 - [c4]Joseph A. Starek, Javier V. Gómez, Edward Schmerling, Lucas Janson, Luis Moreno, Marco Pavone:
An asymptotically-optimal sampling-based algorithm for Bi-directional motion planning. IROS 2015: 2072-2078 - [c3]Lucas Janson, Edward Schmerling, Marco Pavone:
Monte Carlo Motion Planning for Robot Trajectory Optimization Under Uncertainty. ISRR (2) 2015: 343-361 - [c2]Lucas Janson, Brian Ichter, Marco Pavone:
Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance. ISRR (2) 2015: 507-525 - [i7]Lucas Janson, Edward Schmerling, Marco Pavone:
Monte Carlo Motion Planning for Robot Trajectory Optimization Under Uncertainty. CoRR abs/1504.08053 (2015) - [i6]Lucas Janson, Brian Ichter, Marco Pavone:
Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance. CoRR abs/1505.00023 (2015) - [i5]Joseph A. Starek, Javier V. Gómez, Edward Schmerling, Lucas Janson, Luis Moreno, Marco Pavone:
An Asymptotically-Optimal Sampling-Based Algorithm for Bi-directional Motion Planning. CoRR abs/1507.07602 (2015) - [i4]Yinlam Chow, Mohammad Ghavamzadeh, Lucas Janson, Marco Pavone:
Risk-Constrained Reinforcement Learning with Percentile Risk Criteria. CoRR abs/1512.01629 (2015) - 2014
- [i3]Edward Schmerling, Lucas Janson, Marco Pavone:
Optimal Sampling-Based Motion Planning under Differential Constraints: the Driftless Case. CoRR abs/1403.2483 (2014) - [i2]Edward Schmerling, Lucas Janson, Marco Pavone:
Optimal Sampling-Based Motion Planning under Differential Constraints: the Drift Case with Linear Affine Dynamics. CoRR abs/1405.7421 (2014) - 2013
- [c1]Lucas Janson, Marco Pavone:
Fast Marching Trees: A Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions. ISRR 2013: 667-684 - [i1]Lucas Janson, Marco Pavone:
Fast Marching Trees: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions - Extended Version. CoRR abs/1306.3532 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
