![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Ya-Ping Hsieh
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Panayotis Mertikopoulos
, Ya-Ping Hsieh, Volkan Cevher:
A unified stochastic approximation framework for learning in games. Math. Program. 203(1): 559-609 (2024) - [c20]Mohammad Reza Karimi, Ya-Ping Hsieh, Andreas Krause:
Sinkhorn Flow as Mirror Flow: A Continuous-Time Framework for Generalizing the Sinkhorn Algorithm. AISTATS 2024: 4186-4194 - 2023
- [c19]Charlotte Bunne, Ya-Ping Hsieh, Marco Cuturi, Andreas Krause:
The Schrödinger Bridge between Gaussian Measures has a Closed Form. AISTATS 2023: 5802-5833 - [c18]Ya-Ping Hsieh, Mohammad Reza Karimi Jaghargh, Andreas Krause, Panayotis Mertikopoulos:
Riemannian stochastic optimization methods avoid strict saddle points. NeurIPS 2023 - [c17]Mohammad Reza Karimi Jaghargh, Ya-Ping Hsieh, Andreas Krause:
A Dynamical System View of Langevin-Based Non-Convex Sampling. NeurIPS 2023 - [c16]Mohammad Reza Karimi Jaghargh, Ya-Ping Hsieh, Andreas Krause:
Stochastic Approximation Algorithms for Systems of Interacting Particles. NeurIPS 2023 - [c15]Vignesh Ram Somnath, Matteo Pariset
, Ya-Ping Hsieh, María Rodríguez Martínez, Andreas Krause, Charlotte Bunne:
Aligned Diffusion Schrödinger Bridges. UAI 2023: 1985-1995 - [i18]Vignesh Ram Somnath, Matteo Pariset, Ya-Ping Hsieh, María Rodríguez Martínez, Andreas Krause, Charlotte Bunne:
Aligned Diffusion Schrödinger Bridges. CoRR abs/2302.11419 (2023) - [i17]Matteo Pariset, Ya-Ping Hsieh, Charlotte Bunne, Andreas Krause, Valentin De Bortoli:
Unbalanced Diffusion Schrödinger Bridge. CoRR abs/2306.09099 (2023) - [i16]Ya-Ping Hsieh, Mohammad Reza Karimi, Andreas Krause, Panayotis Mertikopoulos:
Riemannian stochastic optimization methods avoid strict saddle points. CoRR abs/2311.02374 (2023) - [i15]Mohammad Reza Karimi, Ya-Ping Hsieh, Andreas Krause:
Sinkhorn Flow: A Continuous-Time Framework for Understanding and Generalizing the Sinkhorn Algorithm. CoRR abs/2311.16706 (2023) - 2022
- [c14]Mohammad Reza Karimi, Ya-Ping Hsieh, Panayotis Mertikopoulos, Andreas Krause:
The Dynamics of Riemannian Robbins-Monro Algorithms. COLT 2022: 3503 - [i14]Charlotte Bunne, Ya-Ping Hsieh, Marco Cuturi, Andreas Krause:
Recovering Stochastic Dynamics via Gaussian Schrödinger Bridges. CoRR abs/2202.05722 (2022) - [i13]Panayotis Mertikopoulos, Ya-Ping Hsieh, Volkan Cevher:
Learning in games from a stochastic approximation viewpoint. CoRR abs/2206.03922 (2022) - [i12]Mohammad Reza Karimi, Ya-Ping Hsieh, Panayotis Mertikopoulos, Andreas Krause:
The Dynamics of Riemannian Robbins-Monro Algorithms. CoRR abs/2206.06795 (2022) - [i11]Tatjana Chavdarova, Ya-Ping Hsieh, Michael I. Jordan:
Continuous-time Analysis for Variational Inequalities: An Overview and Desiderata. CoRR abs/2207.07105 (2022) - [i10]Mohammad Reza Karimi, Ya-Ping Hsieh, Andreas Krause:
A Dynamical System View of Langevin-Based Non-Convex Sampling. CoRR abs/2210.13867 (2022) - 2021
- [c13]Ya-Ping Hsieh, Panayotis Mertikopoulos, Volkan Cevher
:
The Limits of Min-Max Optimization Algorithms: Convergence to Spurious Non-Critical Sets. ICML 2021: 4337-4348 - 2020
- [c12]Maria-Luiza Vladarean, Ahmet Alacaoglu, Ya-Ping Hsieh, Volkan Cevher
:
Conditional gradient methods for stochastically constrained convex minimization. ICML 2020: 9775-9785 - [c11]Parameswaran Kamalaruban, Yu-Ting Huang, Ya-Ping Hsieh, Paul Rolland, Cheng Shi, Volkan Cevher
:
Robust Reinforcement Learning via Adversarial training with Langevin Dynamics. NeurIPS 2020 - [i9]Parameswaran Kamalaruban, Yu-Ting Huang, Ya-Ping Hsieh, Paul Rolland, Cheng Shi, Volkan Cevher:
Robust Reinforcement Learning via Adversarial training with Langevin Dynamics. CoRR abs/2002.06063 (2020) - [i8]Ya-Ping Hsieh, Panayotis Mertikopoulos, Volkan Cevher:
The limits of min-max optimization algorithms: convergence to spurious non-critical sets. CoRR abs/2006.09065 (2020) - [i7]Maria-Luiza Vladarean, Ahmet Alacaoglu, Ya-Ping Hsieh, Volkan Cevher:
Conditional gradient methods for stochastically constrained convex minimization. CoRR abs/2007.03795 (2020)
2010 – 2019
- 2019
- [c10]Ya-Ping Hsieh, Chen Liu, Volkan Cevher
:
Finding Mixed Nash Equilibria of Generative Adversarial Networks. ICML 2019: 2810-2819 - 2018
- [j4]Ya-Ping Hsieh
, Yu-Chun Kao, Rabeeh Karimi Mahabadi, Alp Yurtsever, Anastasios Kyrillidis, Volkan Cevher
:
A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization. IEEE Trans. Signal Process. 66(22): 5917-5926 (2018) - [c9]Ya-Ping Hsieh, Volkan Cevher
:
Dimension-free Information Concentration via Exp-Concavity. ALT 2018: 451-469 - [c8]Ehsan Asadi Kangarshahi, Ya-Ping Hsieh, Mehmet Fatih Sahin, Volkan Cevher
:
Let's be Honest: An Optimal No-Regret Framework for Zero-Sum Games. ICML 2018: 2493-2501 - [c7]Ya-Ping Hsieh, Ali Kavis, Paul Rolland, Volkan Cevher
:
Mirrored Langevin Dynamics. NeurIPS 2018: 2883-2892 - [i6]Ehsan Asadi Kangarshahi, Ya-Ping Hsieh, Mehmet Fatih Sahin, Volkan Cevher:
Let's be honest: An optimal no-regret framework for zero-sum games. CoRR abs/1802.04221 (2018) - [i5]Ya-Ping Hsieh, Volkan Cevher:
Dimension-free Information Concentration via Exp-Concavity. CoRR abs/1802.09301 (2018) - [i4]Ya-Ping Hsieh, Volkan Cevher:
Mirrored Langevin Dynamics. CoRR abs/1802.10174 (2018) - [i3]Ya-Ping Hsieh, Chen Liu, Volkan Cevher:
Finding Mixed Nash Equilibria of Generative Adversarial Networks. CoRR abs/1811.02002 (2018) - 2016
- [j3]David E. Carlson
, Ya-Ping Hsieh, Edo Collins, Lawrence Carin
, Volkan Cevher
:
Stochastic Spectral Descent for Discrete Graphical Models. IEEE J. Sel. Top. Signal Process. 10(2): 296-311 (2016) - [c6]Nissim Zerbib, Yen-Huan Li
, Ya-Ping Hsieh, Volkan Cevher
:
Estimation error of the constrained lasso. Allerton 2016: 433-438 - [c5]Gergely Ódor
, Yen-Huan Li
, Alp Yurtsever, Ya-Ping Hsieh, Quoc Tran-Dinh, Marwa El Halabi, Volkan Cevher
:
Frank-Wolfe works for non-Lipschitz continuous gradient objectives: Scalable poisson phase retrieval. ICASSP 2016: 6230-6234 - [c4]Ashkan Norouzi-Fard, Abbas Bazzi, Ilija Bogunovic, Marwa El Halabi, Ya-Ping Hsieh, Volkan Cevher:
An Efficient Streaming Algorithm for the Submodular Cover Problem. NIPS 2016: 4493-4501 - [i2]Ashkan Norouzi-Fard, Abbas Bazzi, Marwa El Halabi, Ilija Bogunovic, Ya-Ping Hsieh, Volkan Cevher:
An Efficient Streaming Algorithm for the Submodular Cover Problem. CoRR abs/1611.08574 (2016) - 2015
- [c3]Alp Yurtsever, Ya-Ping Hsieh, Volkan Cevher
:
Scalable convex methods for phase retrieval. CAMSAP 2015: 381-384 - [c2]David E. Carlson, Edo Collins, Ya-Ping Hsieh, Lawrence Carin, Volkan Cevher:
Preconditioned Spectral Descent for Deep Learning. NIPS 2015: 2971-2979 - 2013
- [j2]Chuen-Ming Gee, Chien-Chih Tseng, Feng-Yu Wu, Hsin-Ping Chang, Lain-Jong Li
, Ya-Ping Hsieh
, Cheng-Te Lin, Jyh-Chen Chen:
Flexible transparent electrodes made of electrochemically exfoliated graphene sheets from low-cost graphite pieces. Displays 34(4): 315-319 (2013) - [j1]Ya-Ping Hsieh, Yen-Chi Lee, Po-Jen Shih, Ping-Cheng Yeh, Kwang-Cheng Chen
:
On the asynchronous information embedding for event-driven systems in molecular communications. Nano Commun. Networks 4(1): 2-13 (2013) - [i1]Ya-Ping Hsieh, Ping-Cheng Yeh:
Mathematical Foundations for Information Theory in Diffusion-Based Molecular Communications. CoRR abs/1311.4431 (2013) - 2012
- [c1]Ya-Ping Hsieh, Po-Jen Shih, Yen-Chi Lee, Ping-Cheng Yeh, Kwang-Cheng Chen
:
An asynchronous communication scheme for molecular communication. ICC 2012: 6177-6182
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-05-14 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint