The densest hemisphere problem
From MaRDI portal
Cites work
Cited in
(42)- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- The computational complexity of densest region detection
- Exact computation of the halfspace depth
- Best subset binary prediction
- Concentration of the empirical level sets of Tukey's halfspace depth
- Tractable algorithms for robust model estimation
- Some connections between learning and optimization
- On geometric optimization with few violated constraints
- Analysis and test of efficient methods for building recursive deterministic perceptron neural networks
- Robust arbitrage conditions for financial markets
- Robust fitting in computer vision: easy or hard?
- Uniform convergence rates for the approximated halfspace and projection depth
- A centrality notion for graphs based on Tukey depth
- The instability of instability of centered distributions
- A local Vapnik-Chervonenkis complexity
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
- Computational aspects of relaxation complexity: possibilities and limitations
- Solving some vector subset problems by Voronoi diagrams
- On the Nonlearnability of a Single Spiking Neuron
- Theory of Classification: a Survey of Some Recent Advances
- Novel approaches to the discrimination problem
- Training a Single Sigmoidal Neuron Is Hard
- Robust estimators in high-dimensions without the computational intractability
- An exact algorithm for finding a vector subset with the longest sum
- Deep learning: a statistical viewpoint
- The complexity of linear programming
- Generating all vertices of a polyhedron is hard
- Discussion
- Efficient MIP techniques for computing the relaxation complexity
- Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning
- Statistical computational learning
- The best ways to slice a polytope
- A polynomial-time algorithm for computing the yolk in fixed dimension
- Distributionally robust optimization and robust statistics
- Halfspace depth
- On the quality of randomized approximations of Tukey's depth
- Robustly learning general mixtures of Gaussians
- Approximate computation of projection depths
- Optimal length resolution refutations of difference constraint systems
- On the computational complexity of the minimum committee problem
This page was built for publication: The densest hemisphere problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242681)
