Copertina

Instance Dependent Testing of Samplers using Interval Conditioning

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bhattacharyya, Rishiraj, Chakraborty, Sourav, Pote, Yash, Sarkar, Uddalok, Sen, Sayantan
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Artificial Intelligence
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Engineering an Efficient Approximate DNF-Counter
di: Soos, Mate, et al.
Pubblicazione: (2024)

Testing vs Estimation for Index-Invariant Properties in the Huge Object Model
di: Chakraborty, Sourav, et al.
Pubblicazione: (2024)

Testing Sparse Functions over the Reals
di: Arora, Vipul, et al.
Pubblicazione: (2026)

Testing (Conditional) Mutual Information
di: Seyfried, Jan, et al.
Pubblicazione: (2025)

Distance Estimation for High-Dimensional Discrete Distributions
di: Kumar, Gunjan, et al.
Pubblicazione: (2023)

Equivalence Testing: The Power of Bounded Adaptivity
di: Chakraborty, Diptarka, et al.
Pubblicazione: (2024)

A Distribution Testing Approach to Clustering Distributions
di: Kumar, Gunjan, et al.
Pubblicazione: (2025)

Clustering with Label Consistency
di: Chakraborty, Diptarka, et al.
Pubblicazione: (2025)

Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information
di: Gayen, Sutanu, et al.
Pubblicazione: (2024)

Online bipartite matching with imperfect advice
di: Choo, Davin, et al.
Pubblicazione: (2024)

Limited Perfect Monotonical Surrogates constructed using low-cost recursive linkage discovery with guaranteed output
di: Przewozniczek, M. W., et al.
Pubblicazione: (2026)

Near Uniform Triangle Sampling Over Adjacency List Graph Streams
di: Bishnu, Arijit, et al.
Pubblicazione: (2024)

Distribution Learning Meets Graph Structure Sampling
di: Bhattacharyya, Arnab, et al.
Pubblicazione: (2024)

RSVP: Beyond Weisfeiler Lehman Graph Isomorphism Test
di: Dutta, Sourav, et al.
Pubblicazione: (2024)

On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions
di: Luttermann, Malte, et al.
Pubblicazione: (2026)

Testing Robustness of Temporal Transportation Networks via Interval Separators
di: Dondi, Riccardo, et al.
Pubblicazione: (2026)

Approximating Optimal Labelings for Temporal Connectivity
di: Carnevale, Daniele, et al.
Pubblicazione: (2025)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
di: Almansoori, Mahmood K. M., et al.
Pubblicazione: (2025)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
di: Nguyen, Hue T., et al.
Pubblicazione: (2025)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
di: Ganian, Robert, et al.
Pubblicazione: (2025)

Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products
di: Liu, Ruipeng, et al.
Pubblicazione: (2025)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
di: Wang, Long, et al.
Pubblicazione: (2025)

Queueing, Predictions, and LLMs: Challenges and Open Problems
di: Mitzenmacher, Michael, et al.
Pubblicazione: (2025)

Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
di: Han, Yue, et al.
Pubblicazione: (2025)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
di: Benomar, Ziyad, et al.
Pubblicazione: (2025)

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
di: Ihalainen, Hannes, et al.
Pubblicazione: (2025)

An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
di: Ehimwenma, Kennedy E., et al.
Pubblicazione: (2025)

Universal Hirschberg for Width Bounded Dynamic Programs
di: Nye, Logan
Pubblicazione: (2025)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
di: Fioravantes, Foivos, et al.
Pubblicazione: (2025)

Efficient Implementation of the Global Cardinality Constraint with Costs
di: Schmied, Margaux, et al.
Pubblicazione: (2025)

Efficient Detection of Exchangeable Factors in Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Masked Matrix Multiplication for Emergent Sparsity
di: Wheatman, Brian, et al.
Pubblicazione: (2024)

Adaptive Multi-Round Allocation with Stochastic Arrivals
di: Pan, Yuqi, et al.
Pubblicazione: (2026)

Knapsack: Connectedness, Path, and Shortest-Path
di: Dey, Palash, et al.
Pubblicazione: (2023)

Online Allocation with Unknown Shared Supply
di: Neoh, Tzeh Yuan, et al.
Pubblicazione: (2026)

A Survey on the Densest Subgraph Problem and Its Variants
di: Lanciano, Tommaso, et al.
Pubblicazione: (2023)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
di: Chaudhary, Juhi, et al.
Pubblicazione: (2024)

Stochastic Multi-round Submodular Optimization with Budget
di: Auletta, Vincenzo, et al.
Pubblicazione: (2024)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
di: la Tour, Max Dupré, et al.
Pubblicazione: (2024)

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
di: Panda, Atasi, et al.
Pubblicazione: (2022)