On the public citation graph
PAC Learning Intersections of Halfspaces with Membership Queries
0 signed · 60 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1071openalex-snapshot
Composite Geometric Concepts and Polynomial Predictability
inferredcites →https://doi.org/10.1006/inco.1997.2686openalex-snapshot
Efficient Learning with Virtual Threshold Gates
inferredcites →https://doi.org/10.1006/inco.1998.2737openalex-snapshot
Noise-Tolerant Parallel Learning of Geometric Concepts
inferredcites →https://doi.org/10.1006/jcss.1996.0034openalex-snapshot
Computing the Maximum Bichromatic Discrepancy, with Applications to Computer Graphics and Machine Learning
inferredcites →https://doi.org/10.1007/3-540-59119-2_187openalex-snapshot
A space-bounded learning algorithm for axis-parallel rectangles
inferredcites →https://doi.org/10.1007/bf00993471openalex-snapshot
On-Line Learning of Rectangles and Unions of Rectangles
inferredcites →https://doi.org/10.1007/bf00993976openalex-snapshot
Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts
inferredcites →https://doi.org/10.1007/bf01580724openalex-snapshot
A polynomial-time algorithm, based on Newton's method, for linear programming
inferredcites →https://doi.org/10.1007/bf01587075openalex-snapshot
Interior path following primal-dual algorithms. part I: Linear programming
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/pl00001593openalex-snapshot
Complexity theoretic hardness results for query learning
inferredcites →https://doi.org/10.1016/0022-0000(90)90028-jopenalex-snapshot
Prediction-preserving reducibility
inferredcites →https://doi.org/10.1016/0885-064x(90)90012-3openalex-snapshot
On learning a union of half spaces
inferredcites →https://doi.org/10.1023/a:1022869011914openalex-snapshot
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
inferredcites →https://doi.org/10.1109/5.163406openalex-snapshot
Interactive reconstruction via geometric probing
inferredcites →https://doi.org/10.1109/72.80287openalex-snapshot
Neural net algorithms that learn in polynomial time from examples and queries
inferredcites →https://doi.org/10.1109/sfcs.1989.63488openalex-snapshot
On the complexity of learning from counterexamples
inferredcites →https://doi.org/10.1109/sfcs.1993.366856openalex-snapshot
Learning an intersection of k halfspaces over a uniform distribution
inferredcites →https://doi.org/10.1109/sfcs.1996.548492openalex-snapshot
A polynomial-time algorithm for learning noisy linear threshold functions
inferredcites →https://doi.org/10.1145/130385.130424openalex-snapshot
Toward efficient agnostic learning
inferredcites →https://doi.org/10.1145/168304.168345openalex-snapshot
On-line learning of rectangles in noisy environments
inferredcites →https://doi.org/10.1145/180139.181063openalex-snapshot
On the limits of proper learnability of subclasses of DNF formulas
inferredcites →https://doi.org/10.1145/180139.181124openalex-snapshot
Geometrical concept learning and convex polytopes
inferredcites →https://doi.org/10.1145/225298.225310openalex-snapshot
Learning with unreliable boundary queries
inferredcites →https://doi.org/10.1145/225298.225338openalex-snapshot
Concept learning with geometric hypotheses
inferredcites →https://doi.org/10.1145/225298.225339openalex-snapshot
More or less efficient agnostic learning of convex polygons
inferredcites →https://doi.org/10.1145/237814.237854openalex-snapshot
Noise-tolerant distribution-free learning of general geometric concepts
inferredcites →https://doi.org/10.1145/258533.258614openalex-snapshot
A composition theorem for learning algorithms with applications to geometric concept classes
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1162/neco.1990.2.4.510openalex-snapshot
A Polynomial Time Algorithm That Learns Two Hidden Unit Nets
inferredcites →https://doi.org/10.5555/114836.114868openalex-snapshot
Fast identification of geometric objects with membership queries
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11776420_26openalex-snapshot
Improved Lower Bounds for Learning Intersections of Halfspaces
inferred← citeshttps://doi.org/10.1007/s00493-013-2759-7openalex-snapshot
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
inferred← citeshttps://doi.org/10.1007/s10994-007-5010-1openalex-snapshot
Unconditional lower bounds for learning intersections of halfspaces
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104771openalex-snapshot
New cryptographic hardness for learning intersections of halfspaces over boolean cubes with membership queries
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.11.002openalex-snapshot
Learning intersections and thresholds of halfspaces
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.07.008openalex-snapshot
Cryptographic hardness for learning intersections of halfspaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.034openalex-snapshot
Exact learning from an honest teacher that answers membership queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.025openalex-snapshot
A characterization of 2-threshold functions via pairs of prime segments
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00024-7openalex-snapshot
Learning unions of high-dimensional boxes over the reals
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00137-5openalex-snapshot
On the limits of efficient teachability
inferred← citeshttps://doi.org/10.1109/focs.2006.24openalex-snapshot
Cryptographic Hardness for Learning Intersections of Halfspaces
inferred← citeshttps://doi.org/10.1109/focs.2008.64openalex-snapshot
Learning Geometric Concepts via Gaussian Surface Area
inferred← citeshttps://doi.org/10.1109/focs.2009.18openalex-snapshot
The Intersection of Two Halfspaces Has High Threshold Degree
inferred← citeshttps://doi.org/10.1109/focs.2017.40openalex-snapshot
Active Classification with Comparison Queries
inferred← citeshttps://doi.org/10.1109/ines.2007.4283688openalex-snapshot
Lower Bounds on the Vapnik-Chervonenkis Dimension of Convex Polytope Classifiers
inferred← citeshttps://doi.org/10.1109/infocom.2019.8737425openalex-snapshot
Online Channel-state Clustering And Multiuser Capacity Learning For Wireless Scheduling
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181894openalex-snapshot
Learning intersections and thresholds of halfspaces
inferred← citeshttps://doi.org/10.1109/tit.2021.3134898openalex-snapshot
Learning Convex Polyhedra With Margin
inferred← citeshttps://doi.org/10.1109/tnet.2021.3077455openalex-snapshot
Auto-Tuning for Cellular Scheduling Through Bandit-Learning and Low-Dimensional Clustering
inferred← citeshttps://doi.org/10.1137/100785260openalex-snapshot
The Intersection of Two Halfspaces Has High Threshold Degree
inferred← citeshttps://doi.org/10.1145/290179.290184openalex-snapshot
Noise-tolerant distribution-free learning of general geometric concepts
inferred← citeshttps://doi.org/10.1145/3798129.3800866openalex-snapshot
Learning Functions of Halfspaces
inferred← citeshttps://doi.org/10.1184/r1/6604301openalex-snapshot
Computational Applications Of Noise Sensitivity
inferred← citeshttps://doi.org/10.48550/arxiv.1211.2227openalex-snapshot
Efficient learning of simplices
inferred← citeshttps://doi.org/10.48550/arxiv.1705.09269openalex-snapshot
Geometric Methods for Robust Data Analysis in High Dimension
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.