Ya-Ping Hsieh

Orcid: 0000-0002-6065-751X

According to our database1, Ya-Ping Hsieh authored at least 39 papers between 2012 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Support Before Frequency in Discrete Diffusion.
CoRR, May, 2026

Manifold Generalization Provably Proceeds Memorization in Diffusion Models.
CoRR, March, 2026

Verifier-Constrained Flow Expansion for Discovery Beyond the Data.
CoRR, February, 2026

A Unified Density Operator View of Flow Control and Merging.
CoRR, February, 2026

2025
Flow Density Control: Generative Optimization Beyond Entropy-Regularized Fine-Tuning.
CoRR, November, 2025

When Scores Learn Geometry: Rate Separations under the Manifold Hypothesis.
CoRR, September, 2025

Provable Maximum Entropy Manifold Exploration via Diffusion Models.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

2024
A unified stochastic approximation framework for learning in games.
Math. Program., January, 2024

Sinkhorn Flow as Mirror Flow: A Continuous-Time Framework for Generalizing the Sinkhorn Algorithm.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Sinkhorn Flow: A Continuous-Time Framework for Understanding and Generalizing the Sinkhorn Algorithm.
CoRR, 2023

Unbalanced Diffusion Schrödinger Bridge.
CoRR, 2023

Aligned Diffusion Schrödinger Bridges.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Stochastic Approximation Algorithms for Systems of Interacting Particles.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

A Dynamical System View of Langevin-Based Non-Convex Sampling.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Riemannian stochastic optimization methods avoid strict saddle points.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

The Schrödinger Bridge between Gaussian Measures has a Closed Form.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Continuous-time Analysis for Variational Inequalities: An Overview and Desiderata.
CoRR, 2022

Learning in games from a stochastic approximation viewpoint.
CoRR, 2022

Recovering Stochastic Dynamics via Gaussian Schrödinger Bridges.
CoRR, 2022

The Dynamics of Riemannian Robbins-Monro Algorithms.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
The Limits of Min-Max Optimization Algorithms: Convergence to Spurious Non-Critical Sets.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Robust Reinforcement Learning via Adversarial training with Langevin Dynamics.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Conditional gradient methods for stochastically constrained convex minimization.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Finding Mixed Nash Equilibria of Generative Adversarial Networks.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization.
IEEE Trans. Signal Process., 2018

Mirrored Langevin Dynamics.
CoRR, 2018

Mirrored Langevin Dynamics.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Let's be Honest: An Optimal No-Regret Framework for Zero-Sum Games.
Proceedings of the 35th International Conference on Machine Learning, 2018

Dimension-free Information Concentration via Exp-Concavity.
Proceedings of the Algorithmic Learning Theory, 2018

2016
Stochastic Spectral Descent for Discrete Graphical Models.
IEEE J. Sel. Top. Signal Process., 2016

An Efficient Streaming Algorithm for the Submodular Cover Problem.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Frank-Wolfe works for non-Lipschitz continuous gradient objectives: Scalable poisson phase retrieval.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

Estimation error of the constrained lasso.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Preconditioned Spectral Descent for Deep Learning.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Scalable convex methods for phase retrieval.
Proceedings of the 6th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2015

2013
On the asynchronous information embedding for event-driven systems in molecular communications.
Nano Commun. Networks, 2013

Flexible transparent electrodes made of electrochemically exfoliated graphene sheets from low-cost graphite pieces.
Displays, 2013

Mathematical Foundations for Information Theory in Diffusion-Based Molecular Communications.
CoRR, 2013

2012
An asynchronous communication scheme for molecular communication.
Proceedings of IEEE International Conference on Communications, 2012


  Loading...