Search Results for author: Hongyi Zhang

Found 16 papers, 4 papers with code

EdgeFL: A Lightweight Decentralized Federated Learning Framework

no code implementations6 Sep 2023 Hongyi Zhang, Jan Bosch, Helena Holmström Olsson

By leveraging EdgeFL, software engineers can harness the benefits of federated learning while overcoming the challenges associated with existing FL platforms/frameworks.

Federated Learning

Autonomous Navigation and Configuration of Integrated Access Backhauling for UAV Base Station Using Reinforcement Learning

no code implementations14 Dec 2021 Hongyi Zhang, Jingya Li, Zhiqiang Qi, Xingqin Lin, Anders Aronsson, Jan Bosch, Helena Holmström Olsson

A deep reinforcement learning algorithm is designed to jointly optimize the access and backhaul antenna tilt as well as the three-dimensional location of the UAV-BS in order to best serve the on-ground MC users while maintaining a good backhaul connection.

Autonomous Navigation Navigate

One Backward from Ten Forward, Subsampling for Large-Scale Deep Learning

no code implementations27 Apr 2021 Chaosheng Dong, Xiaojie Jin, Weihao Gao, Yijia Wang, Hongyi Zhang, Xiang Wu, Jianchao Yang, Xiaobing Liu

Deep learning models in large-scale machine learning systems are often continuously trained with enormous data from production environments.

Real-time End-to-End Federated Learning: An Automotive Case Study

no code implementations22 Mar 2021 Hongyi Zhang, Jan Bosch, Helena Holmström Olsson

With the development and the increasing interests in ML/DL fields, companies are eager to apply Machine Learning/Deep Learning approaches to increase service quality and customer experience.

Autonomous Driving BIG-bench Machine Learning +1

End-to-End on-device Federated Learning: A case study

no code implementations1 Jan 2021 Hongyi Zhang, Jan Bosch, Helena Holmström Olsson

Because of its characteristics such as model-only exchange and parallel training, the technique can not only preserve user data privacy but also accelerate model training speed.

Autonomous Driving BIG-bench Machine Learning +1

Towards Riemannian Accelerated Gradient Methods

no code implementations7 Jun 2018 Hongyi Zhang, Suvrit Sra

We propose a Riemannian version of Nesterov's Accelerated Gradient algorithm (RAGD), and show that for geodesically smooth and strongly convex problems, within a neighborhood of the minimizer whose radius depends on the condition number as well as the sectional curvature of the manifold, RAGD converges to the minimizer with acceleration.

An Approximate Shading Model with Detail Decomposition for Object Relighting

no code implementations20 Apr 2018 Zicheng Liao, Kevin Karsch, Hongyi Zhang, David Forsyth

We present an object relighting system that allows an artist to select an object from an image and insert it into a target scene.

Object

mixup: Beyond Empirical Risk Minimization

71 code implementations ICLR 2018 Hongyi Zhang, Moustapha Cisse, Yann N. Dauphin, David Lopez-Paz

We also find that mixup reduces the memorization of corrupt labels, increases the robustness to adversarial examples, and stabilizes the training of generative adversarial networks.

Domain Generalization Memorization +2

Matrix Completion from $O(n)$ Samples in Linear Time

no code implementations8 Feb 2017 David Gamarnik, Quan Li, Hongyi Zhang

Under a certain incoherence assumption on $M$ and for the case when both the rank and the condition number of $M$ are bounded, it was shown in \cite{CandesRecht2009, CandesTao2010, keshavan2010, Recht2011, Jain2012, Hardt2014} that $M$ can be recovered exactly or approximately (depending on some trade-off between accuracy and computational complexity) using $O(n \, \text{poly}(\log n))$ samples in super-linear time $O(n^{a} \, \text{poly}(\log n))$ for some constant $a \geq 1$.

Matrix Completion

First-order Methods for Geodesically Convex Optimization

no code implementations19 Feb 2016 Hongyi Zhang, Suvrit Sra

Geodesic convexity generalizes the notion of (vector space) convexity to nonlinear metric spaces.

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