{"total":65,"rows":[{"id":"2210.07277","title":"The Hidden Uniform Cluster Prior in Self-Supervised Learning","created":"2022-10-13","cited_by_count":58,"area":null},{"id":"2102.08410","title":"Evaluating Fairness of Machine Learning Models Under Uncertain and Incomplete Information","created":"2021-02-16","cited_by_count":33,"area":null},{"id":"2106.14043","title":"Improved Approximation Algorithms for Individually Fair Clustering","created":"2021-06-26","cited_by_count":33,"area":null},{"id":"2103.02512","title":"Approximation Algorithms for Socially Fair Clustering","created":"2021-03-03","cited_by_count":25,"area":null},{"id":"2110.09253","title":"A Sociotechnical View of Algorithmic Fairness","created":"2021-09-27","cited_by_count":24,"area":null},{"id":"2106.05423","title":"A New Notion of Individually Fair Clustering: $\\alpha$-Equitable $k$-Center","created":"2021-06-09","cited_by_count":18,"area":null},{"id":"2209.12396","title":"Deep Fair Clustering via Maximizing and Minimizing Mutual Information: Theory, Algorithm and Metric","created":"2022-09-26","cited_by_count":17,"area":null},{"id":"2106.15566","title":"Near-Optimal Explainable $k$-Means for All Dimensions","created":"2021-06-29","cited_by_count":13,"area":null},{"id":"2111.04804","title":"Approximating Fair Clustering with Cascaded Norm Objectives","created":"2021-11-08","cited_by_count":13,"area":null},{"id":"2210.01953","title":"Robust Fair Clustering: A Novel Fairness Attack and Defense Framework","created":"2022-10-04","cited_by_count":13,"area":null},{"id":"2105.14146","title":"Deep Fair Discriminative Clustering","created":"2021-05-28","cited_by_count":10,"area":null},{"id":"2105.14172","title":"A Stochastic Alternating Balance $k$-Means Algorithm for Fair Clustering","created":"2021-05-29","cited_by_count":10,"area":null},{"id":"2106.06755","title":"Tight FPT Approximation for Socially Fair Clustering","created":"2021-06-12","cited_by_count":10,"area":null},{"id":"2206.09346","title":"Fairness-aware Model-agnostic Positive and Unlabeled Learning","created":"2022-06-19","cited_by_count":10,"area":null},{"id":"2306.06778","title":"Approximation Algorithms for Fair Range Clustering","created":"2023-06-11","cited_by_count":10,"area":null},{"id":"2107.01622","title":"Multiple-criteria Based Active Learning with Fixed-size Determinantal Point Processes","created":"2021-07-04","cited_by_count":9,"area":null},{"id":"2305.19475","title":"Doubly Constrained Fair Clustering","created":"2023-05-31","cited_by_count":9,"area":null},{"id":"2206.11210","title":"Constant-Factor Approximation Algorithms for Socially Fair $k$-Clustering","created":"2022-06-22","cited_by_count":8,"area":null},{"id":"2207.03600","title":"Individual Preference Stability for Clustering","created":"2022-07-07","cited_by_count":8,"area":null},{"id":"2402.06730","title":"A Scalable Algorithm for Individually Fair K-means Clustering","created":"2024-02-09","cited_by_count":8,"area":null},{"id":"2311.01862","title":"$R^3$-NL2GQL: A Model Coordination and Knowledge Graph Alignment Approach for NL2GQL","created":"2023-11-03","cited_by_count":7,"area":null},{"id":"2105.03153","title":"Pairwise Fairness for Ordinal Regression","created":"2021-05-07","cited_by_count":6,"area":null},{"id":"2206.05050","title":"Improved Approximation for Fair Correlation Clustering","created":"2022-06-09","cited_by_count":6,"area":null},{"id":"2109.00708","title":"Efficient Algorithms For Fair Clustering with a New Fairness Notion","created":"2021-09-02","cited_by_count":5,"area":null},{"id":"2206.02667","title":"Emergent specialization from participation dynamics and multi-learner retraining","created":"2022-06-06","cited_by_count":5,"area":null},{"id":"2102.03977","title":"Learning to Generate Fair Clusters from Demonstrations","created":"2021-02-08","cited_by_count":4,"area":null},{"id":"2105.05782","title":"How to Design Robust Algorithms using Noisy Comparison Oracle","created":"2021-05-12","cited_by_count":4,"area":null},{"id":"2109.04554","title":"Feature-based Individual Fairness in k-Clustering","created":"2021-09-09","cited_by_count":4,"area":null},{"id":"2202.01391","title":"Fair Representation Clustering with Several Protected Classes","created":"2022-02-03","cited_by_count":4,"area":null},{"id":"2205.14198","title":"Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost","created":"2022-05-27","cited_by_count":4,"area":null},{"id":"2208.00194","title":"Streaming Algorithms for Diversity Maximization with Fairness Constraints","created":"2022-07-30","cited_by_count":3,"area":null},{"id":"2307.12065","title":"Spectral Normalized-Cut Graph Partitioning with Fairness Constraints","created":"2023-07-22","cited_by_count":3,"area":null},{"id":"2401.05502","title":"Diversity-aware clustering: Computational Complexity and Approximation Algorithms","created":"2024-01-10","cited_by_count":3,"area":null},{"id":"2110.08212","title":"NNK-Means: Data summarization using dictionary learning with non-negative kernel regression","created":"2021-10-15","cited_by_count":2,"area":null},{"id":"2205.14358","title":"Fair Labeled Clustering","created":"2022-05-28","cited_by_count":2,"area":null},{"id":"2211.00980","title":"Balancing Utility and Fairness in Submodular Maximization (Technical Report)","created":"2022-11-02","cited_by_count":2,"area":null},{"id":"2301.02053","title":"Max-Min Diversification with Fairness Constraints: Exact and Approximation Algorithms","created":"2023-01-05","cited_by_count":2,"area":null},{"id":"2401.12533","title":"Near-Optimal Algorithms for Constrained k-Center Clustering with Instance-level Background Knowledge","created":"2024-01-23","cited_by_count":2,"area":null},{"id":"2410.12913","title":"Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights","created":"2024-10-16","cited_by_count":2,"area":null},{"id":"2412.06063","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","created":"2024-12-08","cited_by_count":2,"area":null},{"id":"2203.02502","title":"No More Than 6ft Apart: Robust K-Means via Radius Upper Bounds","created":"2022-03-04","cited_by_count":1,"area":null},{"id":"2205.02052","title":"Exploring Rawlsian Fairness for K-Means Clustering","created":"2022-05-04","cited_by_count":1,"area":null},{"id":"2205.14867","title":"Measuring and mitigating voting access disparities: a study of race and polling locations in Florida and North Carolina","created":"2022-05-30","cited_by_count":1,"area":null},{"id":"2209.11762","title":"Towards Auditing Unsupervised Learning Algorithms and Human Processes For Fairness","created":"2022-09-20","cited_by_count":1,"area":null},{"id":"2301.00061","title":"A Global Optimization Algorithm for K-Center Clustering of One Billion Samples","created":"2022-12-30","cited_by_count":1,"area":null},{"id":"2301.02814","title":"Randomized Greedy Algorithms and Composable Coreset for k-Center Clustering with Outliers","created":"2023-01-07","cited_by_count":1,"area":null},{"id":"2305.17557","title":"Fair Clustering via Hierarchical Fair-Dirichlet Process","created":"2023-05-27","cited_by_count":1,"area":null},{"id":"2312.09061","title":"Fair Clustering: A Causal Perspective","created":"2023-12-14","cited_by_count":1,"area":null},{"id":"2403.10365","title":"Scalable Algorithms for Individual Preference Stable Clustering","created":"2024-03-15","cited_by_count":1,"area":null},{"id":"2406.15960","title":"Fair Clustering: Critique, Caveats, and Future Directions","created":"2024-06-22","cited_by_count":1,"area":null},{"id":"2508.04071","title":"Adversarial Fair Multi-View Clustering","created":"2025-08-06","cited_by_count":1,"area":null},{"id":"2210.01888","title":"Bicriteria Approximation Algorithms for Priority Matroid Median","created":"2022-10-04","cited_by_count":0,"area":null},{"id":"2212.14467","title":"Cluster-level Group Representativity Fairness in $k$-means Clustering","created":"2022-12-29","cited_by_count":0,"area":null},{"id":"2311.06192","title":"Greedy PIG: Adaptive Integrated Gradients","created":"2023-11-10","cited_by_count":0,"area":null},{"id":"2405.10378","title":"A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering","created":"2024-05-16","cited_by_count":0,"area":null},{"id":"2409.02963","title":"Fair Clustering with Minimum Representation Constraints","created":"2024-09-04","cited_by_count":0,"area":null},{"id":"2503.00854","title":"FACROC: a fairness measure for FAir Clustering through ROC curves","created":"2025-03-02","cited_by_count":0,"area":null},{"id":"2504.20883","title":"Guessing Efficiently for Constrained Subspace Approximation","created":"2025-04-29","cited_by_count":0,"area":null},{"id":"2511.21109","title":"Interpretable Fair Clustering","created":"2025-11-26","cited_by_count":0,"area":null},{"id":"2512.16185","title":"Weighted K-Harmonic Means Clustering: Convergence Analysis and Applications to Wireless Communications","created":"2025-12-18","cited_by_count":0,"area":null},{"id":"2602.11565","title":"Move What Matters: Parameter-Efficient Domain Adaptation via Optimal Transport Flow for Collaborative Perception","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2602.16688","title":"On the Hardness of Approximation of the Fair k-Center Problem","created":"2026-02-18","cited_by_count":0,"area":null},{"id":"2605.13759","title":"Fast and effective algorithms for fair clustering at scale","created":"2026-05-13","cited_by_count":0,"area":null},{"id":"2605.24458","title":"Balancing Fairness, Privacy, and Accuracy: A Multitask Adversarial Framework for Centralized Data-Driven Systems","created":"2026-05-23","cited_by_count":0,"area":null},{"id":"2609.06384","title":"Parameterized and Streaming Algorithms for Euclidean Fair $k$-Center Clustering","created":"2026-09-06","cited_by_count":0,"area":null}],"next_cursor":null}