Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
157 | Adam R. Klivans, Alexander A. Sherstov |
Unconditional lower bounds for learning intersections of halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 69(2-3), pp. 97-114, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Intersections of halfspaces, Halfspace learning, SQ learning, Lower bounds for learning, Harmonic sieve, PAC learning, Query learning, Statistical queries, Polynomial threshold functions |
146 | Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, Rocco A. Servedio |
Testing halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 256-264, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
130 | Adam R. Klivans, Alexander A. Sherstov |
Improved Lower Bounds for Learning Intersections of Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings, pp. 335-349, 2006, Springer, 3-540-35294-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
99 | Nader H. Bshouty, Ehab Wattad |
On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings, pp. 48-62, 2006, Springer, 3-540-46649-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
99 | Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio |
Learning Intersections and Thresholds of Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 177-186, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
95 | Prahladh Harsha, Adam R. Klivans, Raghu Meka |
An invariance principle for polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 543-552, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
average sensitivity, invariance principles, polytopes, pseudorandom generators, contingency tables, noise sensitivity, limit theorems, agnostic learning |
89 | Raghu Meka, David Zuckerman |
Pseudorandom generators for polynomial threshold functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 427-436, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
invariance principles, polynomials, pseudorandom generators, branching programs, threshold functions, halfspaces |
83 | Adam R. Klivans, Alexander A. Sherstov |
Cryptographic Hardness for Learning Intersections of Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 553-562, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
78 | Subhash Khot, Rishi Saket |
On hardness of learning intersection of two halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 345-354, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
learning, approximation, hardness, halfspaces |
67 | Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami |
New Results for Learning Noisy Parities and Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 563-574, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
67 | Venkatesan Guruswami, Prasad Raghavendra |
Hardness of Learning Halfspaces with Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 543-552, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
63 | Ryan O'Donnell, Rocco A. Servedio |
The chow parameters problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 517-526, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
chow parameters, boolean function, fourier analysis, threshold function |
52 | Adam R. Klivans, Philip M. Long, Alex K. Tang |
Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 588-600, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
52 | Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio |
Agnostically Learning Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 11-20, 2005, IEEE Computer Society, 0-7695-2468-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
52 | Adam R. Klivans, Rocco A. Servedio |
Learning Intersections of Halfspaces with a Margin. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 17th Annual Conference on Learning Theory, COLT 2004, Banff, Canada, July 1-4, 2004, Proceedings, pp. 348-362, 2004, Springer, 3-540-22282-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
47 | Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi |
Learnability and Automatizability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 621-630, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
47 | Klaus-Uwe Höffgen, Hans Ulrich Simon |
Robust Trainability of Single Neurons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, COLT 1992, Pittsburgh, PA, USA, July 27-29, 1992., pp. 428-439, 1992, ACM, 0-89791-497-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
46 | Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola |
Bounded Independence Fools Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 171-180, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
k-wise independent distributions, pseudorandomness, halfspaces |
46 | Alexander A. Sherstov |
The Intersection of Two Halfspaces Has High Threshold Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 343-362, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
intersections of halfspaces, polynomial representations of Boolean functions, PAC learning, rational approximation, direct product theorems |
46 | Avrim Blum, Ravi Kannan |
Learning an Intersection of k Halfspaces over a Uniform Distribution ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 312-320, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
geometric learning, k halfspaces, bounding hyperplanes, polynomial-time algorithm, intersection, uniform distribution |
42 | Boris Aronov, Sariel Har-Peled, Micha Sharir |
On approximate halfspace range counting and relative epsilon-approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 327-336, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
approximate range queries, epsilon-approximations, partition trees, range spaces, queries, discrepancy, range, VC-dimension, halfspaces |
36 | Adam R. Klivans, Philip M. Long, Rocco A. Servedio |
Learning Halfspaces with Malicious Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 609-621, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Adam Tauman Kalai |
Learning Nested Halfspaces and Uphill Decision Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings, pp. 378-392, 2007, Springer, 978-3-540-72925-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Ryan C. Harkins, John M. Hitchcock |
Dimension, Halfspaces, and the Density of Hard Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 129-139, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Tatsuya Akutsu, Sascha Ott |
Inferring a Union of Halfspaces from Examples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 117-126, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Jirí Matousek 0001, Raimund Seidel, Emo Welzl |
How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990, pp. 16-22, 1990, ACM, 0-89791-362-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
32 | Timothy M. Chan |
On the bichromatic k-set problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 561-570, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
32 | Alexander A. Sherstov |
Halfspace Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 83-95, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Haim Kaplan, Micha Sharir |
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 484-493, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Haim Kaplan, Micha Sharir, Elad Verbin |
Colored intersection searching via sparse rectangular matrix multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 52-60, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
colored intersection searching, generalized intersection searching, matrix multiplication, range searching |
32 | Yulai Xie, Jack Snoeyink, Jinhui Xu 0001 |
Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 21-29, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
chebyshev center, maximum inscribed sphere, approximation, polytope, core-set |
32 | Abdullah Bade, Norhaida Mohd. Suaib, Abdullah Mohd Zin, Tengku M. T. Sembok |
Oriented convex polyhedra for collision detection in 3D computer animation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GRAPHITE ![In: Proceedings of the 4th International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia 2006, Kuala Lumpur, Malaysia, November 29 - December 2, 2006, pp. 127-193, 2006, ACM, 1-59593-564-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
virtual environments, collision detection, bounding volumes |
32 | Suzanne F. Buchele, Richard H. Crawford |
Three-dimensional halfspace constructive solid geometry tree construction from implicit boundary representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid Modeling and Applications ![In: Proceedings of the Eighth ACM Symposium on Solid Modeling and Applications 2003, Seattle, Washington, USA, June 16 - 20, 2003, pp. 135-144, 2003, ACM, 1-58113-752-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
product and assembly modeling, representation conversion, reverse engineering, geometric and topological representations |
32 | Nader H. Bshouty, Lynn Burroughs |
Maximizing Agreements and CoAgnostic Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings, pp. 83-97, 2002, Springer, 3-540-00170-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Takeshi Tokuyama |
Efficient Algorithms for the Minimum Diameter Bridge Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers, pp. 362-369, 2000, Springer, 3-540-42306-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
32 | Tibor Hegedüs |
Geometrical Concept Learning and Convex Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 1994., pp. 228-236, 1994, ACM, 0-89791-655-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Nader H. Bshouty, Zhixiang Chen 0001, Steven Homer |
On Learning Discretized Geometric Concepts (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 54-63, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
finite injury priority method, online learning algorithm, geometric concept, discretized geometric concepts, classes of rectangles, polynomial time, PAC-learning, equivalence queries, halfspaces |
20 | Jinyan Su, Jinhui Xu, Di Wang 0015 |
PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 141, pp. 103496, May 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Stefan Tiegel |
Improved Hardness Results for Learning Intersections of Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.15995, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Alkis Kalavasis, Amin Karbasi, Kasper Green Larsen, Grigoris Velegkas, Felix Zhou 0002 |
Replicable Learning of Large-Margin Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.13857, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Yinan Li, Chicheng Zhang |
Efficient Active Learning Halfspaces with Tsybakov Noise: A Non-convex Optimization Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISTATS ![In: International Conference on Artificial Intelligence and Statistics, 2-4 May 2024, Palau de Congressos, Valencia, Spain., pp. 4744-4752, 2024, PMLR. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
20 | Aravind Gollakota, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan |
Tester-Learners for Halfspaces: Universal Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.11765, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Ilias Diakonikolas, Jelena Diakonikolas, Daniel M. Kane, Puqian Wang, Nikos Zarifis |
Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.08438, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Sihan Liu, Nikos Zarifis |
Efficient Testable Learning of Halfspaces with Adversarial Label Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.05485, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Aravind Gollakota, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan |
An Efficient Tester-Learner for Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.14853, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel M. Kane, Lisheng Ren |
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.06512, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Ilias Diakonikolas, Jelena Diakonikolas, Daniel M. Kane, Puqian Wang, Nikos Zarifis |
Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.16352, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Yinan Li, Chicheng Zhang |
Efficient Active Learning Halfspaces with Tsybakov Noise: A Non-convex Optimization Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.15411, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Anindya De, Shivam Nadimpalli, Rocco A. Servedio |
Gaussian Approximation of Convex Sets by Intersections of Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.08575, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Aravind Gollakota, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan |
Tester-Learners for Halfspaces: Universal Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023., 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel Kane 0001, Vasilis Kontonis, Sihan Liu, Nikos Zarifis |
Efficient Testable Learning of Halfspaces with Adversarial Label Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023., 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Jelena Diakonikolas, Daniel Kane 0001, Puqian Wang, Nikos Zarifis |
Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023., 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
20 | Stefan Tiegel |
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: The Thirty Sixth Annual Conference on Learning Theory, COLT 2023, 12-15 July 2023, Bangalore, India., pp. 3029-3064, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Jelena Diakonikolas, Daniel M. Kane, Puqian Wang, Nikos Zarifis |
Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: The Thirty Sixth Annual Conference on Learning Theory, COLT 2023, 12-15 July 2023, Bangalore, India., pp. 2211-2239, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel Kane 0001, Lisheng Ren |
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA., pp. 7922-7938, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
20 | Lies Hadjadj, Massih-Reza Amini, Sana Louhichi |
Generalization Guarantees of Self-Training of Halfspaces under Label Noise Corruption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pp. 3777-3785, 2023, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Jie Shen |
PAC Learning of Halfspaces with Malicious Noise in Nearly Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISTATS ![In: International Conference on Artificial Intelligence and Statistics, 25-27 April 2023, Palau de Congressos, Valencia, Spain., pp. 30-46, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
20 | Ziwei Ji, Kwangjun Ahn, Pranjal Awasthi, Satyen Kale, Stefani Karp |
Agnostic Learnability of Halfspaces via Logistic Loss. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.13419, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Stefan Tiegel |
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.14030, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel M. Kane, Pasin Manurangsi, Lisheng Ren |
Cryptographic Hardness of Learning Halfspaces with Massart Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.14266, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Jinyan Su, Jinhui Xu 0001, Di Wang 0015 |
On PAC Learning Halfspaces in Non-interactive Local Privacy Model with Public Unlabeled Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2209.08319, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Daniel Hsu 0001, Clayton Sanford, Rocco A. Servedio, Emmanouil V. Vlatakis-Gkaragkounis |
Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.05096, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Rajai Nasser, Stefan Tiegel |
Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.09818, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Xi Chen, Shyamal Patel |
Distribution-free Testing for Halfspaces (Almost) Requires PAC Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 1715-1743, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Jinyan Su, Jinhui Xu 0001, Di Wang 0015 |
On PAC Learning Halfspaces in Non-interactive Local Privacy Model with Public Unlabeled Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACML ![In: Asian Conference on Machine Learning, ACML 2022, 12-14 December 2022, Hyderabad, India., pp. 927-941, 2022, PMLR. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel Kane 0001, Pasin Manurangsi, Lisheng Ren |
Cryptographic Hardness of Learning Halfspaces with Massart Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022., 2022, 9781713871088. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Daniel J. Hsu, Clayton Hendrick Sanford, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis |
Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Conference on Learning Theory, 2-5 July 2022, London, UK., pp. 283-312, 2022, PMLR. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel Kane 0001 |
Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Conference on Learning Theory, 2-5 July 2022, London, UK., pp. 4258-4282, 2022, PMLR. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Rajai Nasser, Stefan Tiegel |
Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Conference on Learning Theory, 2-5 July 2022, London, UK., pp. 1047-1074, 2022, PMLR. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis |
Learning general halfspaces with general Massart noise under the Gaussian distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pp. 874-885, 2022, ACM, 978-1-4503-9264-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Ziwei Ji, Kwangjun Ahn, Pranjal Awasthi, Satyen Kale, Stefani Karp |
Agnostic Learnability of Halfspaces via Logistic Loss. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA., pp. 10068-10103, 2022, PMLR. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis |
Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA., pp. 5118-5141, 2022, PMLR. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Difan Zou, Spencer Frei, Quanquan Gu |
Provable Robustness of Adversarial Training for Learning Halfspaces with Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.09437, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Lies Hadjadj, Massih-Reza Amini, Sana Louhichi, Alexis Deschamps |
Self-Training of Halfspaces with Generalization Guarantees under Massart Mislabeling Noise Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.14427, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel M. Kane, Christos Tzamos |
Forster Decomposition and Learning Halfspaces with Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.05582, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis |
Agnostic Proper Learning of Halfspaces under Gaussian Marginals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.05629, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Chicheng Zhang, Yinan Li |
Improved Algorithms for Efficient Active Learning Halfspaces with Massart and Tsybakov noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.05312, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Jie Shen 0005 |
Sample-Optimal PAC Learning of Halfspaces with Malicious Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.06247, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis |
Threshold Phenomena in Learning Halfspaces with Massart Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.08767, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Ning Ding 0001, Dawu Gu |
New cryptographic hardness for learning intersections of halfspaces over boolean cubes with membership queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 281, pp. 104771, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Xingyi Du, Qingnan Zhou, Nathan Carr 0001, Tao Ju |
Boundary-sampled halfspaces: a new representation for constructive solid modeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 40(4), pp. 53:1-53:15, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Jie Shen 0005, Chicheng Zhang |
Attribute-Efficient Learning of Halfspaces with Malicious Noise: Near-Optimal Label Complexity and Noise Tolerance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 16-19 March 2021, Virtual Conference, Worldwide., pp. 1072-1113, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel Kane 0001, Christos Tzamos |
Forster Decomposition and Learning Halfspaces with Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual., pp. 7732-7744, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Maximilian Thiessen, Thomas Gärtner 0001 |
Active Learning of Convex Halfspaces on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual., pp. 23413-23425, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis |
Agnostic Proper Learning of Halfspaces under Gaussian Marginals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Conference on Learning Theory, COLT 2021, 15-19 August 2021, Boulder, Colorado, USA., pp. 1522-1551, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena |
Near Optimal Distributed Learning of Halfspaces with Two Parties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Conference on Learning Theory, COLT 2021, 15-19 August 2021, Boulder, Colorado, USA., pp. 724-758, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Chicheng Zhang, Yinan Li |
Improved Algorithms for Efficient Active Learning Halfspaces with Massart and Tsybakov Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Conference on Learning Theory, COLT 2021, 15-19 August 2021, Boulder, Colorado, USA., pp. 4526-4527, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis |
Efficiently learning halfspaces with Tsybakov noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 88-101, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Suprovat Ghoshal, Rishi Saket |
Hardness of learning DNFs using halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 467-480, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Difan Zou, Spencer Frei, Quanquan Gu |
Provable Robustness of Adversarial Training for Learning Halfspaces with Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event., pp. 13002-13011, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Spencer Frei, Yuan Cao 0006, Quanquan Gu |
Agnostic Learning of Halfspaces with Gradient Descent via Soft Margins. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event., pp. 3417-3426, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Jie Shen 0005 |
Sample-Optimal PAC Learning of Halfspaces with Malicious Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event., pp. 9515-9524, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Jie Shen 0005 |
On the Power of Localized Perceptron for Label-Optimal Learning of Halfspaces with Adversarial Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event., pp. 9503-9514, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Badih Ghazi, Ravi Kumar 0001, Pasin Manurangsi, Thao Nguyen |
Robust and Private Learning of Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISTATS ![In: The 24th International Conference on Artificial Intelligence and Statistics, AISTATS 2021, April 13-15, 2021, Virtual Event., pp. 1603-1611, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis |
Learning Halfspaces with Massart Noise Under Structured Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.05632, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Max Hopkins, Daniel M. Kane, Shachar Lovett, Gaurav Mahajan |
Point Location and Active Learning: Learning Halfspaces Almost Optimally. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.11380, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis |
Learning Halfspaces with Tsybakov Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.06467, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel M. Kane, Pasin Manurangsi |
The Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.15220, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Jie Shen 0005 |
On the Power of Localized Perceptron for Label-Optimal Learning of Halfspaces with Adversarial Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2012.10793, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis |
A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2010.01705, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|