| Publication | Date of Publication | Type |
|---|
| Nonexistence results of solutions for some fractional \(p\)-Laplacian equations in \(\mathbb{R}^{N}\) | 2024-12-18 | Paper |
| Estimating Spatial Autocorrelation With Sampled Network Data | 2024-10-09 | Paper |
| Buckling stability and vibration characteristics of functionally graded graphene platelet-reinforced composites multi-arc concave honeycomb sandwich panels under thermal loading | 2024-08-28 | Paper |
| A multi-layer SPH method to simulate water-soil coupling interaction-based on a new wall boundary model | 2024-07-24 | Paper |
| The efficacy of pessimism in asynchronous Q-learning | 2024-07-21 | Paper |
| Inference for heteroskedastic PCA with missing data | 2024-06-05 | Paper |
| Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model | 2024-03-20 | Paper |
| Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis | 2024-03-20 | Paper |
| Uncertainty Quantification for Nonconvex Tensor Completion: Confidence Intervals, Heteroscedasticity and Optimality | 2024-03-14 | Paper |
| Settling the sample complexity of model-based offline reinforcement learning | 2024-03-11 | Paper |
| Softmax policy gradient methods can take exponential time to converge | 2023-08-01 | Paper |
| Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs | 2023-07-04 | Paper |
| Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence | 2023-06-27 | Paper |
| Online learning of energy consumption for navigation of electric vehicles | 2023-06-19 | Paper |
| Breaking the sample complexity barrier to regret-optimal model-free reinforcement learning | 2023-05-23 | Paper |
| BiRSwinT: bilinear full-scale residual swin-transformer for fine-grained driver behavior recognition | 2023-01-31 | Paper |
| Fast Global Convergence of Natural Policy Gradient Methods with Entropy Regularization | 2022-09-19 | Paper |
| Nonconvex Low-Rank Tensor Completion from Noisy Data | 2022-05-31 | Paper |
| Tackling Small Eigen-Gaps: Fine-Grained Eigenvector Estimation and Inference Under Heteroscedastic Noise | 2022-02-17 | Paper |
| Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction | 2022-02-17 | Paper |
| Spectral Methods for Data Science: A Statistical Perspective | 2021-12-09 | Paper |
| Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data | 2021-12-03 | Paper |
| Learning Mixtures of Low-Rank Models | 2021-07-23 | Paper |
| Nonconvex Matrix Factorization From Rank-One Measurements | 2021-07-22 | Paper |
| Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees | 2021-07-05 | Paper |
| Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices | 2021-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5149230 | 2021-02-08 | Paper |
| Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization | 2020-11-09 | Paper |
| Average-case Complexity of Teaching Convex Polytopes via Halfspace Queries | 2020-06-25 | Paper |
| Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution | 2020-06-15 | Paper |
| Inference and uncertainty quantification for noisy matrix completion | 2020-03-04 | Paper |
| Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview | 2019-10-28 | Paper |
| The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled Chi-square | 2019-09-24 | Paper |
| Learning Shape Analysis | 2019-09-16 | Paper |
| Communication-Efficient Distributed Optimization in Networks with Gradient Tracking and Variance Reduction | 2019-09-12 | Paper |
| On the almost decrease of a subexponential density | 2019-09-05 | Paper |
| Spectral method and regularized MLE are both optimal for top-\(K\) ranking | 2019-07-18 | Paper |
| Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval | 2019-06-26 | Paper |
| Modelling asynchronous assets with jump-diffusion processes | 2019-06-11 | Paper |
| Noise-induced tipping under periodic forcing: Preferred tipping phase in a non-adiabatic forcing regime | 2019-05-24 | Paper |
| Compressive Two-Dimensional Harmonic Retrieval via Atomic Norm Minimization | 2018-08-22 | Paper |
| The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences | 2018-08-16 | Paper |
| Near-optimal Bayesian active learning with correlated and noisy tests | 2018-01-12 | Paper |
| Patterned vegetation, tipping points, and the rate of climate change | 2017-11-24 | Paper |
| Assessing the robustness of spatial pattern sequences in a dryland vegetation model | 2017-09-29 | Paper |
| Recursive Least Squares Constant Modulus Algorithm for Blind Adaptive Array | 2017-09-20 | Paper |
| On the Minimax Capacity Loss Under Sub-Nyquist Universal Sampling | 2017-09-08 | Paper |
| An Upper Bound on Multihop Transmission Capacity With Dynamic Routing Selection | 2017-07-12 | Paper |
| On the Role of Mobility for Multimessage Gossip | 2017-06-08 | Paper |
| Shannon Meets Nyquist: Capacity of Sampled Gaussian Channels | 2017-06-08 | Paper |
| Robust Spectral Compressed Sensing via Structured Matrix Completion | 2017-05-16 | Paper |
| Channel Capacity Under Sub-Nyquist Nonuniform Sampling | 2017-05-16 | Paper |
| Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems | 2017-05-03 | Paper |
| Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming | 2017-04-28 | Paper |
| Information Recovery From Pairwise Measurements | 2017-04-28 | Paper |
| Backing Off From Infinity: Performance Bounds via Concentration of Spectral Measure for Random MIMO Channels | 2017-04-28 | Paper |
| Accelerated dimension-independent adaptive metropolis | 2016-10-28 | Paper |
