Learning Dependency Models for Subset Repair
Fuente:
arXiv
Saved in:
| Main Authors: | Li, Haoda, Chen, Jiahui, Sun, Yu, Song, Shaoxu, Zhang, Haiwei, Yuan, Xiaojie |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
An Improved Pseudopolynomial Time Algorithm for Subset Sum
by: Chen, Lin, et al.
Published: (2024)
by: Chen, Lin, et al.
Published: (2024)
Inverse Quadratic Decay in Random Subset Sum
by: Chen, Edwin, et al.
Published: (2026)
by: Chen, Edwin, et al.
Published: (2026)
Approximate Min-Sum Subset Convolution
by: Stoian, Mihail
Published: (2024)
by: Stoian, Mihail
Published: (2024)
Derandomizing Pseudopolynomial Algorithms for Subset Sum
by: Chan, Timothy M.
Published: (2026)
by: Chan, Timothy M.
Published: (2026)
Beating Bellman's Algorithm for Subset Sum
by: Bringmann, Karl, et al.
Published: (2024)
by: Bringmann, Karl, et al.
Published: (2024)
Optimal Dynamic Parameterized Subset Sampling
by: Gan, Junhao, et al.
Published: (2024)
by: Gan, Junhao, et al.
Published: (2024)
Online Rounding for Set Cover under Subset Arrivals
by: Byrka, Jarosław, et al.
Published: (2025)
by: Byrka, Jarosław, et al.
Published: (2025)
Sumsets, 3SUM, Subset Sum: Now for Real!
by: Fischer, Nick
Published: (2024)
by: Fischer, Nick
Published: (2024)
Subset Balancing and Generalized Subset Sum via Lattices
by: Gao, Yiming, et al.
Published: (2026)
by: Gao, Yiming, et al.
Published: (2026)
An Almost Quadratic Vertex Kernel for Subset Feedback Arc Set in Tournaments
by: Bai, Tian
Published: (2025)
by: Bai, Tian
Published: (2025)
All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
by: Anand, Aditya, et al.
Published: (2025)
by: Anand, Aditya, et al.
Published: (2025)
Did Fourier Really Meet Möbius? Fast Subset Convolution via FFT
by: Stoian, Mihail
Published: (2024)
by: Stoian, Mihail
Published: (2024)
Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs
by: Bai, Tian, et al.
Published: (2022)
by: Bai, Tian, et al.
Published: (2022)
Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime
by: Aggarwal, Divesh, et al.
Published: (2024)
by: Aggarwal, Divesh, et al.
Published: (2024)
Subset-lex: did we miss an order?
by: Arndt, Jörg
Published: (2014)
by: Arndt, Jörg
Published: (2014)
Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
by: Kobayashi, Yasuaki, et al.
Published: (2020)
by: Kobayashi, Yasuaki, et al.
Published: (2020)
On Socially Fair Low-Rank Approximation and Column Subset Selection
by: Song, Zhao, et al.
Published: (2024)
by: Song, Zhao, et al.
Published: (2024)
Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs
by: Banik, Aritra, et al.
Published: (2025)
by: Banik, Aritra, et al.
Published: (2025)
Clustering with Non-adaptive Subset Queries
by: Black, Hadley, et al.
Published: (2024)
by: Black, Hadley, et al.
Published: (2024)
Improved Space Bounds for Subset Sum
by: Belova, Tatiana, et al.
Published: (2024)
by: Belova, Tatiana, et al.
Published: (2024)
Does Subset Sum Admit Short Proofs?
by: Włodarczyk, Michał
Published: (2024)
by: Włodarczyk, Michał
Published: (2024)
Subset verification and search algorithms for causal DAGs
by: Choo, Davin, et al.
Published: (2023)
by: Choo, Davin, et al.
Published: (2023)
Data-Dependent LSH for the Earth Mover's Distance
by: Jayaram, Rajesh, et al.
Published: (2024)
by: Jayaram, Rajesh, et al.
Published: (2024)
Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
by: Chen, Lin, et al.
Published: (2025)
by: Chen, Lin, et al.
Published: (2025)
New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
by: Banik, Aritra, et al.
Published: (2024)
by: Banik, Aritra, et al.
Published: (2024)
TRAPP: An Efficient Point-to-Point Path Planning Algorithm for Road Networks with Restrictions
by: Chen, Hanzhang, et al.
Published: (2024)
by: Chen, Hanzhang, et al.
Published: (2024)
Quantum Speedups for Approximating the John Ellipsoid
by: Li, Xiaoyu, et al.
Published: (2024)
by: Li, Xiaoyu, et al.
Published: (2024)
Subset Sum in Near-Linear Pseudopolynomial Time and Polynomial Space
by: Sajith, Thejas Radhika
Published: (2025)
by: Sajith, Thejas Radhika
Published: (2025)
Dependency-Aware Online Caching
by: Dallot, Julien, et al.
Published: (2024)
by: Dallot, Julien, et al.
Published: (2024)
Concentration of Submodular Functions and Read-k Families Under Negative Dependence
by: Duppala, Sharmila, et al.
Published: (2023)
by: Duppala, Sharmila, et al.
Published: (2023)
Arboricity-Dependent Algorithms for Edge Coloring
by: Bhattacharya, Sayan, et al.
Published: (2023)
by: Bhattacharya, Sayan, et al.
Published: (2023)
Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026)
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026)
Cost Preserving Dependent Rounding for Allocation Problems
by: Rohwedder, Lars, et al.
Published: (2025)
by: Rohwedder, Lars, et al.
Published: (2025)
A Statistical View of Column Subset Selection
by: Sood, Anav, et al.
Published: (2023)
by: Sood, Anav, et al.
Published: (2023)
Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
by: Meel, Kuldeep S., et al.
Published: (2025)
by: Meel, Kuldeep S., et al.
Published: (2025)
Density-Dependent Graph Orientation and Coloring in Scalable MPC
by: Ghaffari, Mohsen, et al.
Published: (2026)
by: Ghaffari, Mohsen, et al.
Published: (2026)
Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
by: Joseph, et al.
Published: (2023)
by: Joseph, et al.
Published: (2023)
Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach
by: Joux, Antoine, et al.
Published: (2024)
by: Joux, Antoine, et al.
Published: (2024)
Dependent randomized rounding for clustering and partition systems with knapsack constraints
by: Harris, David G., et al.
Published: (2017)
by: Harris, David G., et al.
Published: (2017)
On Learning Parities with Dependent Noise
by: Golowich, Noah, et al.
Published: (2024)
by: Golowich, Noah, et al.
Published: (2024)
Similar Items
-
An Improved Pseudopolynomial Time Algorithm for Subset Sum
by: Chen, Lin, et al.
Published: (2024) -
Inverse Quadratic Decay in Random Subset Sum
by: Chen, Edwin, et al.
Published: (2026) -
Approximate Min-Sum Subset Convolution
by: Stoian, Mihail
Published: (2024) -
Derandomizing Pseudopolynomial Algorithms for Subset Sum
by: Chan, Timothy M.
Published: (2026) -
Beating Bellman's Algorithm for Subset Sum
by: Bringmann, Karl, et al.
Published: (2024)