default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJane Lange
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i25]Sitan Chen, Jaume de Dios Pont, Jun-Ting Hsieh, Hsin-Yuan Huang, Jane Lange, Jerry Li:
Predicting quantum channels over general product distributions. CoRR abs/2409.03684 (2024)- 2023
- [c22]Jane Lange, Arsen Vasilyan:
Agnostic proper learning of monotone functions: beyond the black-box correction barrier. FOCS 2023: 1149-1170 - [c21]Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan:
Certification with an NP Oracle. ITCS 2023: 18:1-18:22 - [c20]Guy Blanc, Jane Lange, Chirag Pabbaraju, Colin Sullivan, Li-Yang Tan, Mo Tiwari:
Harnessing the power of choices in decision tree learning. NeurIPS 2023 - [c19]Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan:
Lifting Uniform Learners via Distributional Decomposition. STOC 2023: 1755-1767 - [i24]Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan:
Lifting uniform learners via distributional decomposition. CoRR abs/2303.16208 (2023) - [i23]Jane Lange, Arsen Vasilyan:
Agnostic proper learning of monotone functions: beyond the black-box correction barrier. CoRR abs/2304.02700 (2023) - [i22]Jane Lange, Ephraim Linder, Sofya Raskhodnikova, Arsen Vasilyan:
Local Lipschitz Filters for Bounded-Range Functions. CoRR abs/2308.14716 (2023) - [i21]Guy Blanc, Jane Lange, Chirag Pabbaraju, Colin Sullivan, Li-Yang Tan, Mo Tiwari:
Harnessing the Power of Choices in Decision Tree Learning. CoRR abs/2310.01551 (2023) - 2022
- [j2]Guy Blanc
, Jane Lange, Mingda Qiao, Li-Yang Tan:
Properly Learning Decision Trees in almost Polynomial Time. J. ACM 69(6): 39:1-39:19 (2022) - [j1]Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett:
Polite Combination of Algebraic Datatypes. J. Autom. Reason. 66(3): 331-355 (2022) - [c18]Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan:
On the power of adaptivity in statistical adversaries. COLT 2022: 5030-5061 - [c17]Jane Lange, Ronitt Rubinfeld, Arsen Vasilyan:
Properly learning monotone functions via local correction. FOCS 2022: 75-86 - [c16]Guy Blanc, Jane Lange, Li-Yang Tan:
Reconstructing Decision Trees. ICALP 2022: 24:1-24:17 - [c15]Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan:
A query-optimal algorithm for finding counterfactuals. ICML 2022: 2075-2090 - [c14]Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan:
Popular decision tree algorithms are provably noise tolerant. ICML 2022: 2091-2106 - [c13]Guy Blanc, Jane Lange:
Properly learning decision trees in almost polynomial time. ISAIM 2022 - [c12]Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan:
The query complexity of certification. STOC 2022: 623-636 - [i20]Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan:
The Query Complexity of Certification. CoRR abs/2201.07736 (2022) - [i19]Jane Lange, Ronitt Rubinfeld, Arsen Vasilyan:
Properly learning monotone functions via local reconstruction. CoRR abs/2204.11894 (2022) - [i18]Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan:
Popular decision tree algorithms are provably noise tolerant. CoRR abs/2206.08899 (2022) - [i17]Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan:
Open Problem: Properly learning decision trees in polynomial time? CoRR abs/2206.14431 (2022) - [i16]Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan:
A Query-Optimal Algorithm for Finding Counterfactuals. CoRR abs/2207.07072 (2022) - [i15]Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan:
Certification with an NP Oracle. CoRR abs/2211.02257 (2022) - 2021
- [c11]Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan:
Decision Tree Heuristics Can Fail, Even in the Smoothed Setting. APPROX-RANDOM 2021: 45:1-45:16 - [c10]Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan:
Properly learning decision trees in almost polynomial time. FOCS 2021: 920-929 - [c9]Guy Blanc, Jane Lange, Li-Yang Tan:
Learning Stochastic Decision Trees. ICALP 2021: 30:1-30:16 - [c8]Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett:
Politeness for the Theory of Algebraic Datatypes (Extended Abstract). IJCAI 2021: 4829-4833 - [c7]Guy Blanc, Jane Lange, Li-Yang Tan:
Provably efficient, succinct, and precise explanations. NeurIPS 2021: 6129-6141 - [c6]Guy Blanc, Jane Lange, Li-Yang Tan:
Query strategies for priced information, revisited. SODA 2021: 1638-1650 - [i14]Guy Blanc, Jane Lange, Li-Yang Tan:
Learning stochastic decision trees. CoRR abs/2105.03594 (2021) - [i13]Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan:
Decision tree heuristics can fail, even in the smoothed setting. CoRR abs/2107.00819 (2021) - [i12]Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan:
Properly learning decision trees in almost polynomial time. CoRR abs/2109.00637 (2021) - [i11]Guy Blanc, Jane Lange, Li-Yang Tan:
Provably efficient, succinct, and precise explanations. CoRR abs/2111.01576 (2021) - [i10]Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan:
On the power of adaptivity in statistical adversaries. CoRR abs/2111.10352 (2021) - 2020
- [c5]Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett:
Politeness for the Theory of Algebraic Datatypes. IJCAR (1) 2020: 238-255 - [c4]Guy Blanc, Jane Lange, Li-Yang Tan:
Provable guarantees for decision tree induction: the agnostic setting. ICML 2020: 941-949 - [c3]Guy Blanc, Jane Lange, Li-Yang Tan:
Top-Down Induction of Decision Trees: Rigorous Guarantees and Inherent Limitations. ITCS 2020: 44:1-44:44 - [c2]Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan:
Estimating decision tree learnability with polylogarithmic sample complexity. NeurIPS 2020 - [c1]Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan:
Universal guarantees for decision tree induction via a higher-order splitting criterion. NeurIPS 2020 - [i9]Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett:
Politeness for the Theory of Algebraic Datatypes. CoRR abs/2004.04854 (2020) - [i8]Guy Blanc, Jane Lange, Li-Yang Tan:
Provable guarantees for decision tree induction: the agnostic setting. CoRR abs/2006.00743 (2020) - [i7]Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan:
Universal guarantees for decision tree induction via a higher-order splitting criterion. CoRR abs/2010.08633 (2020) - [i6]Guy Blanc, Jane Lange, Li-Yang Tan:
Query strategies for priced information, revisited. CoRR abs/2010.11381 (2020) - [i5]Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan:
Estimating decision tree learnability with polylogarithmic sample complexity. CoRR abs/2011.01584 (2020) - [i4]Guy Blanc, Jane Lange, Li-Yang Tan:
Testing and reconstruction via decision trees. CoRR abs/2012.08735 (2020)
2010 – 2019
- 2019
- [i3]Guy Blanc, Jane Lange, Li-Yang Tan:
Top-down induction of decision trees: rigorous guarantees and inherent limitations. CoRR abs/1911.07375 (2019) - [i2]Guy Blanc, Jane Lange, Li-Yang Tan:
Constructive derandomization of query algorithms. CoRR abs/1912.03042 (2019) - [i1]Guy Blanc, Jane Lange, Li-Yang Tan:
Top-down induction of decision trees: rigorous guarantees and inherent limitations. Electron. Colloquium Comput. Complex. TR19 (2019)
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-10-22 21:15 CEST 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:
