:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	McWhorter, Atticus, DeFord, Daryl
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Machine Learning Physics and Society
Online Access:	https://arxiv.org/abs/2510.17714
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Free Elections in the Free State: Ensemble Analysis of Redistricting in New Hampshire
by: McWhorter, Atticus, et al.
Published: (2025)

Reinforcement Learning Dynamics of Network Vaccination and Hysteresis: A Double-Edged Sword for Addressing Vaccine Hesitancy
by: McWhorter, Atticus, et al.
Published: (2025)

A Scalable Algorithm for Individually Fair K-means Clustering
by: Bateni, MohammadHossein, et al.
Published: (2024)

Beyond Spectral Clustering: Probabilistic Cuts for Differentiable Graph Partitioning
by: Ghriss, Ayoub
Published: (2025)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
by: Mishra, Nina, et al.
Published: (2025)

Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditing
by: Basu, Debabrota, et al.
Published: (2025)

Structure-Aware Spectral Sparsification via Uniform Edge Sampling
by: He, Kaiwen, et al.
Published: (2025)

Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk
by: Gu, Yuzhou, et al.
Published: (2024)

Causal Equal Protection as Algorithmic Fairness
by: Di Bello, Marcello, et al.
Published: (2024)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
by: Esposito, Emmanuel, et al.
Published: (2022)

Scalable Algorithms for Individual Preference Stable Clustering
by: Mosenzon, Ron, et al.
Published: (2024)

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression
by: Chowdhury, Agniva, et al.
Published: (2024)

An Approximation Algorithm for Graph Label Selection
by: John, Josia, et al.
Published: (2026)

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust
by: Chen, Hongjie, et al.
Published: (2024)

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

Fairness in Streaming Submodular Maximization over a Matroid Constraint
by: Halabi, Marwa El, et al.
Published: (2023)

Correcting Underrepresentation and Intersectional Bias for Classification
by: Diana, Emily, et al.
Published: (2023)

Fairness Implications of Encoding Protected Categorical Attributes
by: Mougan, Carlos, et al.
Published: (2022)

Fair Submodular Cover
by: Chen, Wenjing, et al.
Published: (2024)

Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
by: Funk, Nicole, et al.
Published: (2026)

Continuous Fairness On Data Streams
by: Ghosh, Subhodeep, et al.
Published: (2026)

Matchings, Predictions and Counterfactual Harm in Refugee Resettlement Processes
by: Lee, Seungeon, et al.
Published: (2024)

Time Fairness in Online Knapsack Problems
by: Lechowicz, Adam, et al.
Published: (2023)

Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis
by: Jiang, Minhui, et al.
Published: (2024)

Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling
by: Kook, Yunbum, et al.
Published: (2023)

Learning-Based Algorithms for Graph Searching Problems
by: DePavia, Adela Frances, et al.
Published: (2024)

Partitioning Trillion Edge Graphs on Edge Devices
by: Chhabra, Adil, et al.
Published: (2024)

Ranking with Partitioning
by: Boardman, Samuel
Published: (2026)

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
by: Cheng, Kangke, et al.
Published: (2026)

Sublinear Time Quantum Sensitivity Sampling
by: Song, Zhao, et al.
Published: (2025)

A Unified Framework for Provably Efficient Algorithms to Estimate Shapley Values
by: Chen, Tyler, et al.
Published: (2025)

QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design
by: Yang, Rui, et al.
Published: (2024)

Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach
by: Shakiba, Ali
Published: (2023)

Sublinear Time Quantum Algorithm for Attention Approximation
by: Song, Zhao, et al.
Published: (2026)

Online Sparsification of Bipartite-Like Clusters in Graphs
by: Das, Joyentanuj, et al.
Published: (2025)

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
by: Lee, Changyeol, et al.
Published: (2025)

Robust Dequantization of the Quantum Singular value Transformation and Quantum Machine Learning Algorithms
by: Gall, François Le
Published: (2023)

Sample-Adaptivity Tradeoff in On-Demand Sampling
by: Haghtalab, Nika, et al.
Published: (2025)

In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies
by: Kook, Yunbum, et al.
Published: (2024)

Sampling and Integration of Logconcave Functions by Algorithmic Diffusion
by: Kook, Yunbum, et al.
Published: (2024)