Copertina

Language Generation and Identification From Partial Enumeration: Tight Density Bounds and Topological Characterizations

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Kleinberg, Jon, Wei, Fan
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Computation and Language Discrete Mathematics Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
di: Chakraborty, Dipayan, et al.
Pubblicazione: (2024)

Density Measures for Language Generation
di: Kleinberg, Jon, et al.
Pubblicazione: (2025)

Nearly Tight Bounds on Testing of Metric Properties
di: Bao, Yiqiao, et al.
Pubblicazione: (2024)

Partial Optimality in the Preordering Problem
di: Stein, David, et al.
Pubblicazione: (2026)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
di: Xue, Jinghui, et al.
Pubblicazione: (2024)

Worst-case Error Bounds for Online Learning of Smooth Functions
di: Xie, Weian
Pubblicazione: (2025)

Tight Bounds for Sparsifying Random CSPs
di: Brakensiek, Joshua, et al.
Pubblicazione: (2025)

An Enumerative Perspective on Connectivity
di: Akmal, Shyan
Pubblicazione: (2023)

A Tight Bound on Localization of Electrical Flows
di: Gurel-Gurevich, Ori, et al.
Pubblicazione: (2026)

Tight Paths and Tight Pairs in Weighted Directed Graphs
di: Balcázar, José Luis
Pubblicazione: (2025)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
di: Bentert, Matthias, et al.
Pubblicazione: (2026)

Optimal Enumeration of Eulerian Trails in Directed Graphs
di: Bals, Ben, et al.
Pubblicazione: (2026)

Tight Localizations of Feedback Sets
di: Hecht, Michael, et al.
Pubblicazione: (2020)

Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences
di: Mihalák, Matúš, et al.
Pubblicazione: (2015)

Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
di: Brosse, Caroline, et al.
Pubblicazione: (2024)

Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
di: Bhore, Sujoy, et al.
Pubblicazione: (2026)

Tight Inapproximability of Target Set Reconfiguration
di: Ohsaka, Naoto
Pubblicazione: (2024)

On Tight Robust Coresets for $k$-Medians Clustering
di: Huang, Lingxiao, et al.
Pubblicazione: (2025)

Minimum projective linearizations of trees in linear time
di: Alemany-Puig, Lluís, et al.
Pubblicazione: (2021)

Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms
di: Davies, Sami, et al.
Pubblicazione: (2025)

Exact Causal Attention with 10% Fewer Operations
di: Rybin, Dmitry, et al.
Pubblicazione: (2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
di: Crane, Alex, et al.
Pubblicazione: (2025)

Graph Inference with Effective Resistance Queries
di: Bennett, Huck, et al.
Pubblicazione: (2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
di: Veldt, Nate, et al.
Pubblicazione: (2025)

Foundational theory for optimal decision tree problems. I. Algorithmic and geometric foundations
di: He, Xi
Pubblicazione: (2025)

Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis
di: Sharman, Bharat, et al.
Pubblicazione: (2025)

Optimal hypersurface decision trees
di: He, Xi
Pubblicazione: (2025)

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
di: Tukan, Murad, et al.
Pubblicazione: (2024)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
di: Chen, Yixin, et al.
Pubblicazione: (2024)

Breaking Hard Isomorphism Benchmarks with DRESS
di: Velilla, Eduar Castrillo
Pubblicazione: (2026)

A 4-approximation algorithm for min max correlation clustering
di: Heidrich, Holger, et al.
Pubblicazione: (2023)

On Language Generation in the Limit with Bounded Memory
di: Kleinberg, Jon, et al.
Pubblicazione: (2026)

On the Enumeration of all Unique Paths of Recombining Trinomial Trees
di: Torres, Ethan, et al.
Pubblicazione: (2025)

Enumerating minimal solution sets for metric graph problems
di: Bergougnoux, Benjamin, et al.
Pubblicazione: (2023)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
di: Castelo, Emanuel, et al.
Pubblicazione: (2025)

Language Generation in the Limit
di: Kleinberg, Jon, et al.
Pubblicazione: (2024)

The Computational Complexity of Positive Non-Clashing Teaching in Graphs
di: Ganian, Robert, et al.
Pubblicazione: (2025)

A Unified Approach to Submodular Maximization Under Noise
di: Bhawalkar, Kshipra, et al.
Pubblicazione: (2025)

Total Variation Distance Meets Probabilistic Inference
di: Bhattacharyya, Arnab, et al.
Pubblicazione: (2023)

Partially Ordered Sets Corresponding to the Partition Problem
di: Kubo, Susumu
Pubblicazione: (2024)