Yuting Wei

This page is a disambiguation page, it actually contains mutiple papers from persons of the same or a similar name.

Bibliography

2024
Towards a mathematical theory for consistency training in diffusion models.
CoRR, 2024

A non-asymptotic distributional theory of approximate message passing for sparse and robust regression.
CoRR, 2024

2023
Applying Probabilistic Model Checking to Path Planning for a Smart Multimodal Transportation System Using IoT Sensor Data.
Mob. Networks Appl., February, 2023

Softmax policy gradient methods can take exponential time to converge.
Math. Program., 2023

Federated Natural Policy Gradient Methods for Multi-task Reinforcement Learning.
CoRR, 2023

Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models.
CoRR, 2023

Sharp high-probability sample complexities for policy evaluation with linear function approximation.
CoRR, 2023

Approximate message passing from random initialization with applications to ℤ<sub>2</sub> synchronization.
CoRR, 2023

The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Query-aware Long Video Localization and Relation Discrimination for Deep Video Understanding.
Proceedings of the 31st ACM International Conference on Multimedia, 2023

Self-adaptive Prompt-tuning for Event Extraction in Ancient Chinese Literature.
Proceedings of the International Joint Conference on Neural Networks, 2023

Verbalizer or Classifier? A New Prompt Learning Model for Event Causality Identification.
Proceedings of the International Joint Conference on Neural Networks, 2023

PCENet: Psychological Clues Exploration Network for Multimodal Personality Assessment.
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

2022
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction.
IEEE Trans. Inf. Theory, 2022

Fast Global Convergence of Natural Policy Gradient Methods with Entropy Regularization.
Oper. Res., 2022

Minimax-Optimal Multi-Agent RL in Zero-Sum Markov Games With a Generative Model.
CoRR, 2022

A Non-Asymptotic Framework for Approximate Message Passing in Spiked Models.
CoRR, 2022

Mitigating multiple descents: A model-agnostic framework for risk monotonization.
CoRR, 2022

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning.
CoRR, 2022

A Deep Learning Approach Based on Continuous Wavelet Transform Towards Fall Detection.
Proceedings of the Wireless Algorithms, Systems, and Applications, 2022

Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity.
Proceedings of the International Conference on Machine Learning, 2022

PoetryBERT: Pre-training with Sememe Knowledge for Classical Chinese Poetry.
Proceedings of the Data Mining and Big Data - 7th International Conference, 2022

2021
Tackling Small Eigen-Gaps: Fine-Grained Eigenvector Estimation and Inference Under Heteroscedastic Noise.
IEEE Trans. Inf. Theory, 2021

Bias-corrected Kullback-Leibler distance criterion based model selection with covariables missing at random.
Comput. Stat. Data Anal., 2021

Minimum 𝓁<sub>1</sub>-norm interpolators: Precise asymptotics and multiple descent.
CoRR, 2021

Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Tightening the Dependence on Horizon in the Sample Complexity of Q-Learning.
Proceedings of the 38th International Conference on Machine Learning, 2021

Softmax Policy Gradient Methods Can Take Exponential Time to Converge.
Proceedings of the Conference on Learning Theory, 2021

Uniform Consistency of Cross-Validation Estimators for High-Dimensional Ridge Regression.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Debiasing Evaluations That Are Biased by Evaluations.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
The Local Geometry of Testing in Ellipses: Tight Control via Localized Kolmogorov Widths.
IEEE Trans. Inf. Theory, 2020

The Lasso with general Gaussian designs with applications to hypothesis testing.
CoRR, 2020

Sharp Statistical Guarantees for Adversarially Robust Gaussian Classification.
CoRR, 2020

Inference for linear forms of eigenvectors under minimal eigenvalue separation: Asymmetry and heteroscedasticity.
CoRR, 2020

Randomized tests for high-dimensional regression: A more efficient and powerful solution.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Sharp Statistical Guaratees for Adversarially Robust Gaussian Classification.
Proceedings of the 37th International Conference on Machine Learning, 2020

GeLaiGeLai: A visual platform for analysis of Classical Chinese Poetry based on Knowledge Graph.
Proceedings of the 2020 IEEE International Conference on Knowledge Graph, 2020

2019
Early Stopping for Kernel Boosting Algorithms: A General Analysis With Localized Complexities.
IEEE Trans. Inf. Theory, 2019

2018
From Gauss to Kolmogorov: Localized Measures of Complexity for Ellipses.
CoRR, 2018

2017
The local geometry of testing in ellipses: Tight control via localized Kolomogorov widths.
CoRR, 2017

The geometry of hypothesis testing over convex cones: Generalized likelihood tests and minimax radii.
CoRR, 2017

2016
Sharp minimax bounds for testing discrete monotone distributions.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
基于移动锚节点的改进DV-Hop算法 (Improved DV-Hop Algorithm Based on Mobile Anchor Nodes).
计算机科学, 2015

2014
Examining the Impacts of Website Complexities on User Satisfaction Based on the Task-Technology Fit Model: an Experimental Research using an Eyetracking Device.
Proceedings of the 18th Pacific Asia Conference on Information Systems, 2014


  Loading...