The following pages link to Yuting Wei (Q583510):
Displaying 21 items.
- On the existence and uniqueness for solutions of Boussinesq equations (Q583511) (← links)
- The geometry of hypothesis testing over convex cones: generalized likelihood ratio tests and minimax radii (Q666588) (← links)
- On the existence and uniqueness of classical global solution to a type of Boussinesq equations (Q1263013) (← links)
- Model averaging for linear models with responses missing at random (Q2042525) (← links)
- Robust model selection with covariables missing at random (Q2135520) (← links)
- From Gauss to Kolmogorov: localized measures of complexity for ellipses (Q2199701) (← links)
- Bias-corrected Kullback-Leibler distance criterion based model selection with covariables missing at random (Q2242002) (← links)
- Vaccination dilemma on an evolving social network (Q2328280) (← links)
- Cross-validation-based model averaging in linear models with response missing at random (Q2657994) (← links)
- Mathematical analysis of a fluid—solid interaction problem (Q3152201) (← links)
- Stabilized finite element methods for miscible displacement in porous media (Q4698874) (← links)
- Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction (Q5030298) (← links)
- Tackling Small Eigen-Gaps: Fine-Grained Eigenvector Estimation and Inference Under Heteroscedastic Noise (Q5032583) (← links)
- Fast Global Convergence of Natural Policy Gradient Methods with Entropy Regularization (Q5106383) (← links)
- The Local Geometry of Testing in Ellipses: Tight Control via Localized Kolmogorov Widths (Q5124490) (← links)
- Early Stopping for Kernel Boosting Algorithms: A General Analysis With Localized Complexities (Q5211468) (← links)
- Softmax policy gradient methods can take exponential time to converge (Q6110457) (← links)
- Derandomizing Knockoffs (Q6165283) (← links)
- Settling the sample complexity of model-based offline reinforcement learning (Q6192326) (← links)
- Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model (Q6198737) (← links)
- Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis (Q6198738) (← links)