Imagen de Portada

Impossibility of Depth Reduction in Explainable Clustering

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Deng, Chengyuan, Gavva, Surya Teja, S., Karthik C., Patel, Parth, Srinivasan, Adarsh
Formato:	Preprint
Publicado:	2023
Materias:	Machine Learning Computational Complexity Computational Geometry Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On Approximability of Steiner Tree in $\ell_p$-metrics
por: Fleischmann, Henry, et al.
Publicado: (2023)

On Approximability of $\ell_2^2$ Min-Sum Clustering
por: S., Karthik C., et al.
Publicado: (2024)

Inapproximability of Maximum Diameter Clustering for Few Clusters
por: Fleischmann, Henry, et al.
Publicado: (2023)

Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

On connections between k-coloring and Euclidean k-means
por: Aman, Enver, et al.
Publicado: (2024)

Hardness of Median and Center in the Ulam Metric
por: Fischer, Nick, et al.
Publicado: (2025)

Near-Optimal Bounds for Parameterized Euclidean k-means
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

Fine-Grained Complexity of Continuous Euclidean k-Center
por: Blank, Lotte, et al.
Publicado: (2026)

The Computational Complexity of Almost Stable Clustering with Penalties
por: Khodamoradi, Kamyar, et al.
Publicado: (2025)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
por: Austrin, Per, et al.
Publicado: (2024)

Generalizing Fair Top-$k$ Selection: An Integrative Approach
por: Cai, Guangya
Publicado: (2026)

Improved Hardness of Approximation for Geometric Bin Packing
por: Ray, Arka, et al.
Publicado: (2023)

Universal Solvability for Robot Motion Planning on Graphs
por: Dhar, Anubhav, et al.
Publicado: (2025)

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
por: Bringmann, Karl, et al.
Publicado: (2024)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2020)

Recognizing 2-Layer and Outer $k$-Planar Graphs
por: Kobayashi, Yasuaki, et al.
Publicado: (2024)

Subcoloring of (Unit) Disk Graphs
por: Marin, Malory, et al.
Publicado: (2025)

Beyond Bits: An Introduction to Computation over the Reals
por: Miltzow, Tillmann
Publicado: (2026)

Fast and simple multiplication of bounded twin-width matrices
por: Kozma, László, et al.
Publicado: (2026)

Computational Complexities of Folding
por: Eppstein, David
Publicado: (2024)

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
por: Goodrich, Michael T., et al.
Publicado: (2024)

Approximate Algorithms for Chamfer Distance Under Translation
por: Halevi, Gil, et al.
Publicado: (2026)

On Approximating the Dynamic and Discrete Network Flow Problem
por: Manna, Bubai, et al.
Publicado: (2024)

Ideal Membership Problem for Boolean Minority and Dual Discriminator
por: Bharathi, Arpitha P., et al.
Publicado: (2024)

Time complexity of the Analyst's Traveling Salesman algorithm
por: Ramirez, Anthony, et al.
Publicado: (2022)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
por: S., Karthik C., et al.
Publicado: (2024)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

AdaBoost is not an Optimal Weak to Strong Learner
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2023)

Superconstant Inapproximability of Decision Tree Learning
por: Koch, Caleb, et al.
Publicado: (2024)

Exact and Approximate Algorithms for Polytree Learning
por: Harviainen, Juha, et al.
Publicado: (2026)

Differentially Private Verification of Distribution Properties
por: Du, Elbert, et al.
Publicado: (2026)

Efficient and Private Property Testing via Indistinguishability
por: Dwork, Cynthia, et al.
Publicado: (2025)

Fast decision tree learning solves hard coding-theoretic problems
por: Koch, Caleb, et al.
Publicado: (2024)

Adaptive and oblivious statistical adversaries are equivalent
por: Blanc, Guy, et al.
Publicado: (2024)

A Distributional-Lifting Theorem for PAC Learning
por: Blanc, Guy, et al.
Publicado: (2025)

Private graphon estimation via sum-of-squares
por: Chen, Hongjie, et al.
Publicado: (2024)

Low-Degree Method Fails to Predict Robust Subspace Recovery
por: Jia, He, et al.
Publicado: (2026)

Feature Selection and Junta Testing are Statistically Equivalent
por: Beretta, Lorenzo, et al.
Publicado: (2025)

Omnipredictors for Regression and the Approximate Rank of Convex Functions
por: Gopalan, Parikshit, et al.
Publicado: (2024)