Liren Shan

IEEE Trans. Netw. Sci. Eng., 2026

Heterogeneous Multi-agent Multi-armed Bandit on Stochastic Block Models.

[BibT_eX]

[DOI]

Proceedings of the Abstracts of the 2026 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2026

AI Suppression: E-Discovery Software and <i>Brady</i>.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computer Science and Law, 2026

Verifying E-discovery Classifiers with Limited Disclosure.

[BibT_eX]

[DOI]

Siddharth Bhandari

Proceedings of the Symposium on Computer Science and Law, 2026

Testing Under Strategic Manipulation: Mechanism Design for Human and AI Institutions.

[BibT_eX]

[DOI]

Xiaoyun Qiu

Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025

Learning Confidence Ellipsoids and Applications to Robust Subspace Recovery.

[BibT_eX]

[DOI]

Chao Gao

Vaidehi Srinivas

CoRR, December, 2025

Dynamic Algorithm for Explainable k-medians Clustering under lp Norm.

[BibT_eX]

[DOI]

Ilias Papanikolaou

CoRR, December, 2025

Verifying Classification with Limited Disclosure.

[BibT_eX]

[DOI]

Siddharth Bhandari

CoRR, February, 2025

Multi-dimensional Test Design.

[BibT_eX]

[DOI]

Xiaoyun Qiu

CoRR, February, 2025

Heterogeneous Multi-agent Multi-armed Bandits on Stochastic Block Models.

[BibT_eX]

[DOI]

CoRR, February, 2025

Volume Optimality in Conformal Prediction with Structured Prediction Sets.

[BibT_eX]

[DOI]

Chao Gao

Vaidehi Srinivas

Proceedings of the Forty-second International Conference on Machine Learning, 2025

Computing High-dimensional Confidence Sets for Arbitrary Distributions.

[BibT_eX]

[DOI]

Chao Gao

Vaidehi Srinivas

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

LiD-FL: Towards List-Decodable Federated Learning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024

Higher-Order Cheeger Inequality for Partitioning with Buffers.

[BibT_eX]

[DOI]

Yury Makarychev

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Error-Tolerant E-Discovery Protocols.

[BibT_eX]

[DOI]

Jinshuo Dong

Jason D. Hartline

Proceedings of the Symposium on Computer Science and Law, 2024

Dynamic Curing and Network Design in SIS Epidemic Processes.

[BibT_eX]

[DOI]

Philip E. Paré

Proceedings of the 63rd IEEE Conference on Decision and Control, 2024

2023

Approximation Algorithms for Norm Multiway Cut.

[BibT_eX]

[DOI]

Charlie Carlson

Jafar Jafarov

Yury Makarychev

CoRR, 2023

Random Cuts are Optimal for Explainable k-Medians.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Approximation Algorithm for Norm Multiway Cut.

[BibT_eX]

[DOI]

Charlie Carlson

Jafar Jafarov

Yury Makarychev

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Optimal Scoring Rules for Multi-dimensional Effort.

[BibT_eX]

[DOI]

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022

Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models.

[BibT_eX]

[DOI]

Philip E. Paré

SIAM J. Control. Optim., 2022

Fair Curing and Network Design in SIS Epidemic Processes.

[BibT_eX]

[DOI]

Philip E. Paré

CoRR, 2022

Explainable <i>k</i>-means: don't be greedy, plant bigger trees!

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Optimization of Scoring Rules.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Algorithmic Learning Foundations for Common Law.

[BibT_eX]

[DOI]

Proceedings of the 2022 Symposium on Computer Science and Law, 2022

2021

Explainable k-means. Don't be greedy, plant bigger trees!

[BibT_eX]

[DOI]

CoRR, 2021

Near-Optimal Algorithms for Explainable k-Medians and k-Means.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Improved Guarantees for k-means++ and k-means++ Parallel.

[BibT_eX]

[DOI]

Aravind Reddy

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Stochastic Linear Optimization with Adversarial Corruption.

[BibT_eX]

[DOI]

Yingkai Li

Edmund Y. Lou

CoRR, 2019

Current Flow Group Closeness Centrality for Complex Networks?

[BibT_eX]

[DOI]

Proceedings of the World Wide Web Conference, 2019

2018

Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket.

[BibT_eX]

[DOI]

Huan Li

Zhongzhi Zhang

Theor. Comput. Sci., 2018

Biharmonic Distance Related Centrality for Edges in Weighted Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Improving Information Centrality of a Node in Complex Networks by Adding Edges.

[BibT_eX]

[DOI]

Zhongzhi Zhang

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Robustness of First- and Second-Order Consensus Algorithms for a Noisy Scale-Free Small-World Koch Network.

[BibT_eX]

[DOI]

IEEE Trans. Control. Syst. Technol., 2017

Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph.

[BibT_eX]

[DOI]