Scalable Algorithms for Individual Preference Stable Clustering
Fuente:
arXiv
Guardado en:
| Autores principales: | Mosenzon, Ron, Vakilian, Ali |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A Scalable Algorithm for Individually Fair K-means Clustering
por: Bateni, MohammadHossein, et al.
Publicado: (2024)
por: Bateni, MohammadHossein, et al.
Publicado: (2024)
Learning-Based Algorithms for Graph Searching Problems
por: DePavia, Adela Frances, et al.
Publicado: (2024)
por: DePavia, Adela Frances, et al.
Publicado: (2024)
A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)
Welfare-Centric Clustering
por: Zhang, Claire Jie, et al.
Publicado: (2025)
por: Zhang, Claire Jie, et al.
Publicado: (2025)
Fair Clustering: Critique, Caveats, and Future Directions
por: Dickerson, John, et al.
Publicado: (2024)
por: Dickerson, John, et al.
Publicado: (2024)
Robust Fair Clustering with Group Membership Uncertainty Sets
por: Duppala, Sharmila, et al.
Publicado: (2024)
por: Duppala, Sharmila, et al.
Publicado: (2024)
Causal Equal Protection as Algorithmic Fairness
por: Di Bello, Marcello, et al.
Publicado: (2024)
por: Di Bello, Marcello, et al.
Publicado: (2024)
Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
por: Mosenzon, Ron
Publicado: (2025)
por: Mosenzon, Ron
Publicado: (2025)
Graph-Based Nearest-Neighbor Search without the Spread
por: Giliberti, Jeff, et al.
Publicado: (2026)
por: Giliberti, Jeff, et al.
Publicado: (2026)
Block-Diagonal Guided DBSCAN Clustering
por: Zhao, Weibing
Publicado: (2024)
por: Zhao, Weibing
Publicado: (2024)
On Socially Fair Low-Rank Approximation and Column Subset Selection
por: Song, Zhao, et al.
Publicado: (2024)
por: Song, Zhao, et al.
Publicado: (2024)
Fast EXP3 Algorithms
por: Sato, Ryoma, et al.
Publicado: (2025)
por: Sato, Ryoma, et al.
Publicado: (2025)
On Tradeoffs in Learning-Augmented Algorithms
por: Benomar, Ziyad, et al.
Publicado: (2025)
por: Benomar, Ziyad, et al.
Publicado: (2025)
Simulation of Graph Algorithms with Looped Transformers
por: de Luca, Artur Back, et al.
Publicado: (2024)
por: de Luca, Artur Back, et al.
Publicado: (2024)
The CLRS-Text Algorithmic Reasoning Language Benchmark
por: Markeeva, Larisa, et al.
Publicado: (2024)
por: Markeeva, Larisa, et al.
Publicado: (2024)
Positional Attention: Expressivity and Learnability of Algorithmic Computation
por: de Luca, Artur Back, et al.
Publicado: (2024)
por: de Luca, Artur Back, et al.
Publicado: (2024)
Diversity-aware clustering: Computational Complexity and Approximation Algorithms
por: Thejaswi, Suhas, et al.
Publicado: (2024)
por: Thejaswi, Suhas, et al.
Publicado: (2024)
Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditing
por: Basu, Debabrota, et al.
Publicado: (2025)
por: Basu, Debabrota, et al.
Publicado: (2025)
An Algorithm for Learning Smaller Representations of Models With Scarce Data
por: de Wynter, Adrian
Publicado: (2020)
por: de Wynter, Adrian
Publicado: (2020)
Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
por: Li, Dongyue, et al.
Publicado: (2025)
por: Li, Dongyue, et al.
Publicado: (2025)
Pareto Optimal Algorithmic Recourse in Multi-cost Function
por: Chen, Wen-Ling, et al.
Publicado: (2025)
por: Chen, Wen-Ling, et al.
Publicado: (2025)
OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms
por: Sun, Yiwen, et al.
Publicado: (2024)
por: Sun, Yiwen, et al.
Publicado: (2024)
AlgoSelect: Universal Algorithm Selection via the Comb Operator
por: Yao, Jasper
Publicado: (2025)
por: Yao, Jasper
Publicado: (2025)
Hardness of Approximation for Shortest Path with Vector Costs
por: Carlson, Charlie, et al.
Publicado: (2025)
por: Carlson, Charlie, et al.
Publicado: (2025)
Learning the Positions in CountSketch
por: Li, Yi, et al.
Publicado: (2023)
por: Li, Yi, et al.
Publicado: (2023)
Prior Knowledge Makes It Possible: From Sublinear Graph Algorithms to LLM Test-Time Methods
por: Blum, Avrim, et al.
Publicado: (2025)
por: Blum, Avrim, et al.
Publicado: (2025)
Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
por: Guan, Xinyu, et al.
Publicado: (2025)
por: Guan, Xinyu, et al.
Publicado: (2025)
A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
por: Sharma, Vidya Sagar
Publicado: (2023)
por: Sharma, Vidya Sagar
Publicado: (2023)
Centralized Selection with Preferences in the Presence of Biases
por: Celis, L. Elisa, et al.
Publicado: (2024)
por: Celis, L. Elisa, et al.
Publicado: (2024)
Guessing Efficiently for Constrained Subspace Approximation
por: Bhaskara, Aditya, et al.
Publicado: (2025)
por: Bhaskara, Aditya, et al.
Publicado: (2025)
Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
por: Chuzhoy, Julia, et al.
Publicado: (2025)
por: Chuzhoy, Julia, et al.
Publicado: (2025)
Which Algorithms Can Graph Neural Networks Learn?
por: Wittig, Solveig, et al.
Publicado: (2026)
por: Wittig, Solveig, et al.
Publicado: (2026)
Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach
por: Shakiba, Ali
Publicado: (2023)
por: Shakiba, Ali
Publicado: (2023)
Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs
por: Wienöbst, Marcel, et al.
Publicado: (2022)
por: Wienöbst, Marcel, et al.
Publicado: (2022)
Linear-Time Primitives for Algorithm Development in Graphical Causal Inference
por: Wienöbst, Marcel, et al.
Publicado: (2025)
por: Wienöbst, Marcel, et al.
Publicado: (2025)
Fair Submodular Cover
por: Chen, Wenjing, et al.
Publicado: (2024)
por: Chen, Wenjing, et al.
Publicado: (2024)
Matchings, Predictions and Counterfactual Harm in Refugee Resettlement Processes
por: Lee, Seungeon, et al.
Publicado: (2024)
por: Lee, Seungeon, et al.
Publicado: (2024)
Fairness in Streaming Submodular Maximization over a Matroid Constraint
por: Halabi, Marwa El, et al.
Publicado: (2023)
por: Halabi, Marwa El, et al.
Publicado: (2023)
Correcting Underrepresentation and Intersectional Bias for Classification
por: Diana, Emily, et al.
Publicado: (2023)
por: Diana, Emily, et al.
Publicado: (2023)
Fairness Implications of Encoding Protected Categorical Attributes
por: Mougan, Carlos, et al.
Publicado: (2022)
por: Mougan, Carlos, et al.
Publicado: (2022)
Ejemplares similares
-
A Scalable Algorithm for Individually Fair K-means Clustering
por: Bateni, MohammadHossein, et al.
Publicado: (2024) -
Learning-Based Algorithms for Graph Searching Problems
por: DePavia, Adela Frances, et al.
Publicado: (2024) -
A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024) -
Welfare-Centric Clustering
por: Zhang, Claire Jie, et al.
Publicado: (2025) -
Fair Clustering: Critique, Caveats, and Future Directions
por: Dickerson, John, et al.
Publicado: (2024)