The following pages link to Yuxin Chen (Q1688975):
Displayed 50 items.
- Near-optimal Bayesian active learning with correlated and noisy tests (Q1688977) (← links)
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees (Q2039795) (← links)
- Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data (Q2054540) (← links)
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
- The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled Chi-square (Q2273603) (← links)
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking (Q2313284) (← links)
- On the almost decrease of a subexponential density (Q2322670) (← links)
- Modelling asynchronous assets with jump-diffusion processes (Q2417140) (← links)
- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval (Q2425162) (← links)
- Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices (Q2656603) (← links)
- BiRSwinT: bilinear full-scale residual swin-transformer for fine-grained driver behavior recognition (Q2681913) (← links)
- Accelerated Dimension-Independent Adaptive Metropolis (Q2830629) (← links)
- Information Recovery From Pairwise Measurements (Q2976592) (← links)
- Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming (Q2977389) (← links)
- Backing Off From Infinity: Performance Bounds via Concentration of Spectral Measure for Random MIMO Channels (Q2978825) (← links)
- Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems (Q2979257) (← links)
- Robust Spectral Compressed Sensing via Structured Matrix Completion (Q2986119) (← links)
- Channel Capacity Under Sub-Nyquist Nonuniform Sampling (Q2986218) (← links)
- On the Role of Mobility for Multimessage Gossip (Q2989222) (← links)
- Compressive Two-Dimensional Harmonic Retrieval via Atomic Norm Minimization (Q4579754) (← links)
- The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences (Q4581298) (← links)
- Patterned vegetation, tipping points, and the rate of climate change (Q4594566) (← links)
- Nonconvex Matrix Factorization From Rank-One Measurements (Q5001494) (← links)
- Learning Mixtures of Low-Rank Models (Q5001814) (← links)
- Spectral Methods for Data Science: A Statistical Perspective (Q5015834) (← 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)
- Nonconvex Low-Rank Tensor Completion from Noisy Data (Q5080674) (← links)
- Fast Global Convergence of Natural Policy Gradient Methods with Entropy Regularization (Q5106383) (← links)
- Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization (Q5131966) (← links)
- (Q5149230) (← links)
- Inference and uncertainty quantification for noisy matrix completion (Q5218483) (← links)
- Learning Shape Analysis (Q5233237) (← links)
- Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview (Q5240484) (← links)
- An Upper Bound on Multihop Transmission Capacity With Dynamic Routing Selection (Q5271905) (← links)
- Shannon Meets Nyquist: Capacity of Sampled Gaussian Channels (Q5346417) (← links)
- On the Minimax Capacity Loss Under Sub-Nyquist Universal Sampling (Q5352596) (← links)
- Recursive Least Squares Constant Modulus Algorithm for Blind Adaptive Array (Q5356888) (← links)
- Assessing the robustness of spatial pattern sequences in a dryland vegetation model (Q5363538) (← links)
- Noise-induced tipping under periodic forcing: Preferred tipping phase in a non-adiabatic forcing regime (Q5377539) (← links)
- Breaking the sample complexity barrier to regret-optimal model-free reinforcement learning (Q6039766) (← links)
- Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs (Q6109969) (← links)
- Softmax policy gradient methods can take exponential time to converge (Q6110457) (← links)
- Online learning of energy consumption for navigation of electric vehicles (Q6157210) (← links)
- Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence (Q6161312) (← links)
- Settling the sample complexity of model-based offline reinforcement learning (Q6192326) (← links)
- Uncertainty Quantification for Nonconvex Tensor Completion: Confidence Intervals, Heteroscedasticity and Optimality (Q6196111) (← 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)
- Communication-Efficient Distributed Optimization in Networks with Gradient Tracking and Variance Reduction (Q6325192) (← links)