Search Results for author: Zihao Hu

Found 8 papers, 0 papers with code

Extragradient Type Methods for Riemannian Variational Inequality Problems

no code implementations25 Sep 2023 Zihao Hu, Guanghui Wang, Xi Wang, Andre Wibisono, Jacob Abernethy, Molei Tao

In the context of Euclidean space, it is established that the last-iterates of both the extragradient (EG) and past extragradient (PEG) methods converge to the solution of monotone variational inequality problems at a rate of $O\left(\frac{1}{\sqrt{T}}\right)$ (Cai et al., 2022).

Randomized Quantization is All You Need for Differential Privacy in Federated Learning

no code implementations20 Jun 2023 Yeojoon Youn, Zihao Hu, Juba Ziani, Jacob Abernethy

To the best of our knowledge, this is the first study that solely relies on randomized quantization without incorporating explicit discrete noise to achieve Renyi DP guarantees in Federated Learning systems.

Federated Learning Quantization

On Riemannian Projection-free Online Learning

no code implementations30 May 2023 Zihao Hu, Guanghui Wang, Jacob Abernethy

The projection operation is a critical component in a wide range of optimization algorithms, such as online gradient descent (OGD), for enforcing constraints and achieving optimal regret bounds.

Faster Margin Maximization Rates for Generic and Adversarially Robust Optimization Methods

no code implementations NeurIPS 2023 Guanghui Wang, Zihao Hu, Claudio Gentile, Vidya Muthukumar, Jacob Abernethy

To address this limitation, we present a series of state-of-the-art implicit bias rates for mirror descent and steepest descent algorithms.

Binary Classification

Minimizing Dynamic Regret on Geodesic Metric Spaces

no code implementations17 Feb 2023 Zihao Hu, Guanghui Wang, Jacob Abernethy

In this paper, we consider the sequential decision problem where the goal is to minimize the general dynamic regret on a complete Riemannian manifold.

Open-Ended Question Answering

Adaptive Oracle-Efficient Online Learning

no code implementations17 Oct 2022 Guanghui Wang, Zihao Hu, Vidya Muthukumar, Jacob Abernethy

The classical algorithms for online learning and decision-making have the benefit of achieving the optimal performance guarantees, but suffer from computational complexity limitations when implemented at scale.

Decision Making

Supervised Hashing based on Energy Minimization

no code implementations2 Dec 2017 Zihao Hu, Xiyi Luo, Hongtao Lu, Yong Yu

Recently, supervised hashing methods have attracted much attention since they can optimize retrieval speed and storage cost while preserving semantic information.

Retrieval

Bayesian Supervised Hashing

no code implementations CVPR 2017 Zihao Hu, Junxuan Chen, Hongtao Lu, Tongzhen Zhang

To address this problem, we present a novel fully Bayesian treatment for supervised hashing problem, named Bayesian Supervised Hashing (BSH), in which hyperparameters are automatically tuned during optimization.

Cannot find the paper you are looking for? You can Submit a new open access paper.