Random separating hyperplane theorem and learning polytopes

DOI10.4230/LIPICS.ICALP.2024.25MaRDI QIDQ6875183zbMATH OpenFDO

Authors Chiranjib Bhattacharyya, R. Kannan, Amit Kumar

Publication date 14 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2024.25

zbMATH Keywords

learning polytopesoptimization oraclesseparating hyperplane theorem

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• 10.1162/jmlr.2003.3.4-5.993
• A spectral algorithm for latent Dirichlet allocation
• Adaptive estimation of a quadratic functional by model selection.
• Convex optimization theory.
• Efficient Bayesian estimation from few samples: community detection and related problems
• Extensions of Lipschitz mappings into a Hilbert space
• Finding a latent k–simplex in O* (k · nnz(data)) time via Subset Smoothing
• Optimality of the Johnson-Lindenstrauss lemma
• Problems and results in extremal combinatorics. I.
• Random variables, monotone relations, and convex analysis
• Sparse Approximation via Generating Point Sets

This page was built for publication: Random separating hyperplane theorem and learning polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875183)