Tractable Non-Convexity:Matrix Completion,Saddlepoints,and Gradient Descent

来源 :上海交通大学 | 被引量 : 0次 | 上传用户:yeshi804883653
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  Matrix completion is a fundamental machine learning problem with wide applications in collaborative filtering and recommender systems.
其他文献
Real world data(RWD)refers to subject-oriented data captured without interference or bias from the environment and methodology of the data collection itself.
会议
Electricity prices are high dimensional,serially dependent and have seasonal variations.We propose a Warping Functional AutoRegressive(WFAR)model that simultaneously accounts for the cross time-depend
To apply a group sequential procedure for clinical trials with multiple subgroups or multiple endpoints,the closed testing procedure based on the Bonferroni test can be used jointly,as a group sequent
A dynamic treatment regime is a sequence of decision rules that specify how the dosage and/or type of treatment should be adjusted through time in response to an individuals changing needs.
会议
Recurrent event data are important data type for medical research.In particular,many safety endpoints are recurrent outcomes,such as hypoglycemic events.
Most analyses of accelerated life test(ALT)ignore random effects even if information is available to estimate these effects because of difficulties in the traditional frequentist analysis methods.Igno
We consider the semi-competing risks situation where a terminal event(e.g.death)censors a non-terminal event(e.g.disease recurrence),but not vice versa.
We consider the challenges in modeling and estimating large-scale functional brain connectivity with a hierarchical and modular structure from high-dimensional functional magnetic resonance imaging(fM