default search action
Hao Yu 0002
Person information
- affiliation: University of Southern California, Department of Electrical Engineering, Los Angeles, CA, USA
Other persons with the same name
- Hao Yu — disambiguation page
- Hao Yu 0001
— Southern University of Science and Technology, Shenzhen, China (and 3 more)
- Hao Yu 0003
- Hao Yu 0004
- Hao Yu 0005 — Fujitsu Research and Development Center, Beijing, China
- Hao Yu 0006
- Hao Yu 0007
- Hao Yu 0008 — IBM T.J. Watson Research Center, Yorktown Heights, NY, USA (and 1 more)
- Hao Yu 0009 — University of Mannheim, Germany
- Hao Yu 0010
- Cody Hao Yu
- Hao Yu 0012
- Hao Yu 0013
- Hao Yu 0014
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c11]Dongsheng Ding, Xiaohan Wei, Hao Yu, Mihailo R. Jovanovic:
Byzantine-resilient distributed learning under constraints. ACC 2021: 2260-2265 - 2020
- [j9]Hao Yu, Michael J. Neely:
A Low Complexity Algorithm with O(√T) Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints. J. Mach. Learn. Res. 21: 1:1-1:24 (2020) - [j8]Xiaohan Wei, Hao Yu, Michael J. Neely:
Online Primal-Dual Mirror Descent under Stochastic Constraints. Proc. ACM Meas. Anal. Comput. Syst. 4(2): 39:1-39:36 (2020) - [c10]Xiaohan Wei, Hao Yu, Michael J. Neely:
Online Primal-Dual Mirror Descent under Stochastic Constraints. SIGMETRICS (Abstracts) 2020: 3-4
2010 – 2019
- 2019
- [j7]Hao Yu
Learning-Aided Optimization for Energy-Harvesting Devices With Outdated State Information. IEEE/ACM Trans. Netw. 27(4): 1501-1514 (2019) - 2018
- [j6]Xiaohan Wei, Hao Yu, Michael J. Neely:
Online Learning in Weakly Coupled Markov Decision Processes: A Convergence Time Study. Proc. ACM Meas. Anal. Comput. Syst. 2(1): 12:1-12:38 (2018) - [j5]Hao Yu
On the Convergence Time of Dual Subgradient Methods for Strongly Convex Programs. IEEE Trans. Autom. Control. 63(4): 1105-1112 (2018) - [j4]Hao Yu
A New Backpressure Algorithm for Joint Rate Control and Routing With Vanishing Utility Optimality Gaps and Finite Queue Lengths. IEEE/ACM Trans. Netw. 26(4): 1605-1618 (2018) - [c9]Hao Yu, Michael J. Neely:
Learning Aided Optimization for Energy Harvesting Devices with Outdated State Information. INFOCOM 2018: 1853-1861 - [c8]Xiaohan Wei, Hao Yu, Qing Ling, Michael J. Neely:
Solving Non-smooth Constrained Programs with Lower Complexity than \mathcal{O}(1/\varepsilon): A Primal-Dual Homotopy Smoothing Approach. NeurIPS 2018: 3999-4009 - [c7]Xiaohan Wei, Hao Yu, Michael J. Neely:
Online Learning in Weakly Coupled Markov Decision Processes: A Convergence Time Study. SIGMETRICS (Abstracts) 2018: 56-58 - [i7]Hao Yu, Michael J. Neely:
Learning Aided Optimization for Energy Harvesting Devices with Outdated State Information. CoRR abs/1801.03572 (2018) - [i6]Xiaohan Wei, Hao Yu, Qing Ling, Michael J. Neely:
Solving Non-smooth Constrained Programs with Lower Complexity than 𝒪(1/ε): A Primal-Dual Homotopy Smoothing Approach. CoRR abs/1809.01275 (2018) - 2017
- [j3]Hao Yu, Michael J. Neely:
A Simple Parallel Algorithm with an O(1/t) Convergence Rate for General Convex Programs. SIAM J. Optim. 27(2): 759-783 (2017) - [j2]Hao Yu
Dynamic Transmit Covariance Design in MIMO Fading Systems With Unknown Channel Distributions and Inaccurate Channel State Information. IEEE Trans. Wirel. Commun. 16(6): 3996-4008 (2017) - [c6]Hao Yu, Michael J. Neely:
A new backpressure algorithm for joint rate control and routing with vanishing utility optimality gaps and finite queue lengths. INFOCOM 2017: 1-9 - [c5]Hao Yu, Michael J. Neely, Xiaohan Wei:
Online Convex Optimization with Stochastic Constraints. NIPS 2017: 1428-1438 - [i5]Hao Yu, Michael J. Neely:
A New Backpressure Algorithm for Joint Rate Control and Routing with Vanishing Utility Optimality Gaps and Finite Queue Lengths. CoRR abs/1701.04519 (2017) - 2016
- [c4]Hao Yu, Michael J. Neely:
A primal-dual type algorithm with the O(1/t) convergence rate for large scale constrained convex programs. CDC 2016: 1900-1905 - [c3]Hao Yu, Michael J. Neely:
Dynamic power allocation in MIMO fading systems without channel distribution information. INFOCOM 2016: 1-9 - [i4]Hao Yu, Michael J. Neely:
A Primal-Dual Type Algorithm with the O(1/t) Convergence Rate for Large Scale Constrained Convex Programs. CoRR abs/1604.02216 (2016) - [i3]Hao Yu, Michael J. Neely:
A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and Finite Constraint Violations for Online Convex Optimization with Long Term Constraints. CoRR abs/1604.02218 (2016) - 2015
- [c2]Hao Yu, Michael J. Neely:
On the convergence time of the drift-plus-penalty algorithm for strongly convex programs. CDC 2015: 2673-2679 - [i2]Hao Yu, Michael J. Neely:
Dynamic Power Allocation in MIMO Fading Systems Without Channel Distribution Information. CoRR abs/1512.08419 (2015) - 2014
- [j1]Hao Yu, Michael J. Neely:
Duality Codes and the Integrality Gap Bound for Index Coding. IEEE Trans. Inf. Theory 60(11): 7256-7268 (2014) - 2013
- [c1]Hao Yu, Michael J. Neely:
Duality codes and the integrality gap bound for index coding. Allerton 2013: 1553-1560 - [i1]Hao Yu, Michael J. Neely:
Duality Codes and the Integrality Gap Bound for Index Coding. CoRR abs/1307.2295 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: