Jane Lange - RankMe

59 papers A* 20A 4Misc 1Journal 32Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Limitations of Membership Queries in Testable Learning. ITCS Jane Lange, Mingda Qiao
2026	A	`conf`	Samplability Makes Learning Easier. ITCS Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2025	A*	`conf`	A Distributional-Lifting Theorem for PAC Learning. COLT Guy Blanc, Jane Lange, Carmen Strassle, Li-Yang Tan
2025	J	`jnl`	A Distributional-Lifting Theorem for PAC Learning. CoRR Guy Blanc, Jane Lange, Carmen Strassle, Li-Yang Tan
2025	J	`jnl`	Limitations of Membership Queries in Testable Learning. CoRR Jane Lange, Mingda Qiao
2025	A*	`conf`	Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions. SODA Jane Lange, Ephraim Linder, Sofya Raskhodnikova, Arsen Vasilyan
2025	A*	`conf`	Predicting quantum channels over general product distributions. COLT Sitan Chen, Jaume de Dios Pont, Jun-Ting Hsieh, Hsin-Yuan Huang, Jane Lange, Jerry Li
2025	J	`jnl`	Robust learning of halfspaces under log-concave marginals. CoRR Jane Lange, Arsen Vasilyan
2025	J	`jnl`	Samplability makes learning easier. CoRR Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2025	J	`jnl`	The power of quantum circuits in sampling. CoRR Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2024	J	`jnl`	Predicting quantum channels over general product distributions. CoRR Sitan Chen, Jaume de Dios Pont, Jun-Ting Hsieh, Hsin-Yuan Huang, Jane Lange, Jerry Li
2023	A*	`conf`	Agnostic proper learning of monotone functions: beyond the black-box correction barrier. FOCS Jane Lange, Arsen Vasilyan
2023	J	`jnl`	Agnostic proper learning of monotone functions: beyond the black-box correction barrier. CoRR Jane Lange, Arsen Vasilyan
2023	A	`conf`	Certification with an NP Oracle. ITCS Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2023	J	`jnl`	Harnessing the Power of Choices in Decision Tree Learning. CoRR Guy Blanc, Jane Lange, Chirag Pabbaraju, Colin Sullivan, Li-Yang Tan, Mo Tiwari
2023	A*	`conf`	Harnessing the power of choices in decision tree learning. NeurIPS Guy Blanc, Jane Lange, Chirag Pabbaraju, Colin Sullivan, Li-Yang Tan, Mo Tiwari
2023	A*	`conf`	Lifting Uniform Learners via Distributional Decomposition. STOC Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2023	J	`jnl`	Lifting uniform learners via distributional decomposition. CoRR Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2023	J	`jnl`	Local Lipschitz Filters for Bounded-Range Functions. CoRR Jane Lange, Ephraim Linder, Sofya Raskhodnikova, Arsen Vasilyan
2022	J	`jnl`	A Query-Optimal Algorithm for Finding Counterfactuals. CoRR Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
2022	A*	`conf`	A query-optimal algorithm for finding counterfactuals. ICML Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
2022	J	`jnl`	Certification with an NP Oracle. CoRR Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2022	A*	`conf`	On the power of adaptivity in statistical adversaries. COLT Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2022	J	`jnl`	Open Problem: Properly learning decision trees in polynomial time? CoRR Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2022	J	`jnl`	Polite Combination of Algebraic Datatypes. J. Autom. Reason. Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett
2022	A*	`conf`	Popular decision tree algorithms are provably noise tolerant. ICML Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2022	J	`jnl`	Popular decision tree algorithms are provably noise tolerant. CoRR Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2022	J	`jnl`	Properly Learning Decision Trees in almost Polynomial Time. J. ACM Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2022	Misc	`conf`	Properly learning decision trees in almost polynomial time. ISAIM Guy Blanc, Jane Lange
2022	A*	`conf`	Properly learning monotone functions via local correction. FOCS Jane Lange, Ronitt Rubinfeld, Arsen Vasilyan
2022	J	`jnl`	Properly learning monotone functions via local reconstruction. CoRR Jane Lange, Ronitt Rubinfeld, Arsen Vasilyan
2022	A*	`conf`	Reconstructing Decision Trees. ICALP Guy Blanc, Jane Lange, Li-Yang Tan
2022	J	`jnl`	The Query Complexity of Certification. CoRR Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
2022	A*	`conf`	The query complexity of certification. STOC Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
2021	—	`conf`	Decision Tree Heuristics Can Fail, Even in the Smoothed Setting. APPROX-RANDOM Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2021	J	`jnl`	Decision tree heuristics can fail, even in the smoothed setting. CoRR Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2021	A*	`conf`	Learning Stochastic Decision Trees. ICALP Guy Blanc, Jane Lange, Li-Yang Tan
2021	J	`jnl`	Learning stochastic decision trees. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2021	J	`jnl`	On the power of adaptivity in statistical adversaries. CoRR Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2021	A*	`conf`	Politeness for the Theory of Algebraic Datatypes (Extended Abstract). IJCAI Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett
2021	A*	`conf`	Properly learning decision trees in almost polynomial time. FOCS Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2021	J	`jnl`	Properly learning decision trees in almost polynomial time. CoRR Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2021	A*	`conf`	Provably efficient, succinct, and precise explanations. NeurIPS Guy Blanc, Jane Lange, Li-Yang Tan
2021	J	`jnl`	Provably efficient, succinct, and precise explanations. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2021	A*	`conf`	Query strategies for priced information, revisited. SODA Guy Blanc, Jane Lange, Li-Yang Tan
2020	A*	`conf`	Estimating decision tree learnability with polylogarithmic sample complexity. NeurIPS Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
2020	J	`jnl`	Estimating decision tree learnability with polylogarithmic sample complexity. CoRR Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
2020	—	`conf`	Politeness for the Theory of Algebraic Datatypes. IJCAR (1) Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett
2020	J	`jnl`	Politeness for the Theory of Algebraic Datatypes. CoRR Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett
2020	A*	`conf`	Provable guarantees for decision tree induction: the agnostic setting. ICML Guy Blanc, Jane Lange, Li-Yang Tan
2020	J	`jnl`	Provable guarantees for decision tree induction: the agnostic setting. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2020	J	`jnl`	Query strategies for priced information, revisited. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2020	J	`jnl`	Testing and reconstruction via decision trees. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2020	A	`conf`	Top-Down Induction of Decision Trees: Rigorous Guarantees and Inherent Limitations. ITCS Guy Blanc, Jane Lange, Li-Yang Tan
2020	A*	`conf`	Universal guarantees for decision tree induction via a higher-order splitting criterion. NeurIPS Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
2020	J	`jnl`	Universal guarantees for decision tree induction via a higher-order splitting criterion. CoRR Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
2019	J	`jnl`	Constructive derandomization of query algorithms. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2019	J	`jnl`	Top-down induction of decision trees: rigorous guarantees and inherent limitations. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2019	J	`jnl`	Top-down induction of decision trees: rigorous guarantees and inherent limitations. Electron. Colloquium Comput. Complex. Guy Blanc, Jane Lange, Li-Yang Tan