Huy L. Nguyen

SIAM J. Comput., 2025

2024

Efficient Adaptive Optimization via Subset-Norm and Subspace-Momentum: Fast, Memory-Reduced Training with Convergence Guarantees.

[BibT_eX]

[DOI]

Thien Hang Nguyen

Tharani Thathsara Rajapaksha

CoRR, 2024

2022

Real-Time Weather Monitoring and IoT-Based Palmtop Device for Smart Agriculture.

[BibT_eX]

[DOI]

SN Comput. Sci., 2022

Improved Learning-augmented Algorithms for k-means and k-medians Clustering.

[BibT_eX]

[DOI]

CoRR, 2022

Streaming Submodular Maximization with Differential Privacy.

[BibT_eX]

[DOI]

CoRR, 2022

An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret.

[BibT_eX]

[DOI]

CoRR, 2022

Fair Range k-center.

[BibT_eX]

[DOI]

CoRR, 2022

Improved Worst-Group Robustness via Classifier Retraining on Independent Splits.

[BibT_eX]

[DOI]

Thien Hang Nguyen

Hongyang R. Zhang

CoRR, 2022

Incremental Neural Synthesis for Spiking Neural Networks.

[BibT_eX]

[DOI]

Dominique F. Chu

Proceedings of the IEEE Symposium Series on Computational Intelligence, 2022

Locally Private k-Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Constraints on Hebbian and STDP learned weights of a spiking neuron.

[BibT_eX]

[DOI]

Dominique F. Chu

Neural Networks, 2021

Linear Constraints Learning for Spiking Neurons.

[BibT_eX]

[DOI]

Dominique F. Chu

CoRR, 2021

Multi-View Audio And Music Classification.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2021

Self-Attention Generative Adversarial Network for Speech Enhancement.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2021

Differentially Private Decomposable Submodular Maximization.

[BibT_eX]

[DOI]

Lydia Zakynthinou

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Differentially Private Clustering via Maximum Coverage.

[BibT_eX]

[DOI]

CoRR, 2020

Efficient Private Algorithms for Learning Large-Margin Halfspaces.

[BibT_eX]

[DOI]

Jonathan R. Ullman

Lydia Zakynthinou

Proceedings of the Algorithmic Learning Theory, 2020

2016

Submodular Maximization over Sliding Windows.

[BibT_eX]

[DOI]

Jiecao Chen

Qin Zhang

CoRR, 2016

The Problem of the Optimal Packing of the Equal Circles for Special Non-Euclidean Metric.

[BibT_eX]

[DOI]

Alexander L. Kazakov

Anna A. Lempert

Proceedings of the Analysis of Images, Social Networks and Texts, 2016

2015

Approximate k-flat Nearest Neighbor Search.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014

Preserving Terminal Distances Using Minors.

[BibT_eX]

[DOI]

Robert Krauthgamer

Tamar Zondiner

SIAM J. Discret. Math., 2014

Lower Bound for High-Dimensional Statistical Learning Problem via Direct-Sum Theorem.

[BibT_eX]

[DOI]

Ankit Garg

Tengyu Ma

CoRR, 2014

Cutting corners cheaply, or how to remove Steiner points.

[BibT_eX]

[DOI]

Lior Kamma

Robert Krauthgamer

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

On Communication Cost of Distributed Statistical Estimation and Dimensionality.

[BibT_eX]

[DOI]

Ankit Garg

Tengyu Ma

Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013

Approximate Nearest Neighbor Search in ℓ<sub>p</sub>.

[BibT_eX]

[DOI]

CoRR, 2013

Eigenvalues of a matrix in the streaming model.

[BibT_eX]

[DOI]

Alexandr Andoni

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Tight Lower Bound for Linear Sketches of Moments.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Big data.

[BibT_eX]

[DOI]

Andrew Cron

Aditya G. Parameswaran

XRDS, 2012

Width of points in the streaming model.

[BibT_eX]

[DOI]

Alexandr Andoni

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Sublinear Time Algorithms for Earth Mover's Distance.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Near Linear Lower Bound for Dimension Reduction in L1.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Near-Optimal Sublinear Time Algorithms for Ulam Distance.

[BibT_eX]

[DOI]

Alexandr Andoni