Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Stein's method meets computational statistics: A review of some recent developments
Stein's method compares probability distributions through the study of a class of linear
operators called Stein operators. While mainly studied in probability and used to underpin …
operators called Stein operators. While mainly studied in probability and used to underpin …
Global planning for contact-rich manipulation via local smoothing of quasi-dynamic contact models
The empirical success of reinforcement learning (RL) in contact-rich manipulation leaves
much to be understood from a model-based perspective, where the key difficulties are often …
much to be understood from a model-based perspective, where the key difficulties are often …
Fall prediction, control, and recovery of quadruped robots
When legged robots perform complex tasks in unstructured environments, falls are
inevitable due to unknown external disturbances. However, current research mainly focuses …
inevitable due to unknown external disturbances. However, current research mainly focuses …
Efficient estimation of the central mean subspace via smoothed gradient outer products
We consider the problem of sufficient dimension reduction (SDR) for multi-index models.
The estimators of the central mean subspace in prior works either have slow (non …
The estimators of the central mean subspace in prior works either have slow (non …
Adaptive explainable neural networks (axnns)
While machine learning techniques have been successfully applied in several fields, the
black-box nature of the models presents challenges for interpreting and explaining the …
black-box nature of the models presents challenges for interpreting and explaining the …
On the statistical rate of nonlinear recovery in generative models with heavy-tailed data
We consider estimating a high-dimensional vector from non-linear measurements where the
unknown vector is represented by a generative model $ G:\mathbb {R}^ k\rightarrow\mathbb …
unknown vector is represented by a generative model $ G:\mathbb {R}^ k\rightarrow\mathbb …
Understanding implicit regularization in over-parameterized single index model
In this article, we leverage over-parameterization to design regularization-free algorithms for
the high-dimensional single index model and provide theoretical guarantees for the induced …
the high-dimensional single index model and provide theoretical guarantees for the induced …
Ucb-based algorithms for multinomial logistic regression bandits
Out of the rich family of generalized linear bandits, perhaps the most well studied ones are
logistic bandits that are used in problems with binary rewards: for instance, when the learner …
logistic bandits that are used in problems with binary rewards: for instance, when the learner …
Misspecified nonconvex statistical optimization for sparse phase retrieval
Existing nonconvex statistical optimization theory and methods crucially rely on the correct
specification of the underlying “true” statistical models. To address this issue, we take a first …
specification of the underlying “true” statistical models. To address this issue, we take a first …
Efficient algorithms for non-Gaussian single index models with generative priors
In this work, we focus on high-dimensional single index models with non-Gaussian sensing
vectors and generative priors. More specifically, our goal is to estimate the underlying signal …
vectors and generative priors. More specifically, our goal is to estimate the underlying signal …