Search Results for author: Jong-Shi Pang

Found 4 papers, 2 papers with code

Statistical Analysis of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization

no code implementations6 Oct 2019 Zhengling Qi, Ying Cui, Yufeng Liu, Jong-Shi Pang

This paper has two main goals: (a) establish several statistical properties---consistency, asymptotic distributions, and convergence rates---of stationary solutions and values of a class of coupled nonconvex and nonsmoothempirical risk minimization problems, and (b) validate these properties by a noisy amplitude-based phase retrieval problem, the latter being of much topical interest. Derived from available data via sampling, these empirical risk minimization problems are the computational workhorse of a population risk model which involves the minimization of an expected value of a random functional.

Retrieval

Estimation of Individualized Decision Rules Based on an Optimized Covariate-Dependent Equivalent of Random Outcomes

no code implementations27 Aug 2019 Zhengling Qi, Ying Cui, Yufeng Liu, Jong-Shi Pang

Recent exploration of optimal individualized decision rules (IDRs) for patients in precision medicine has attracted a lot of attention due to the heterogeneous responses of patients to different treatments.

Decision Making

Clustering by Orthogonal NMF Model and Non-Convex Penalty Optimization

1 code implementation3 Jun 2019 Shuai Wang, Tsung-Hui Chang, Ying Cui, Jong-Shi Pang

We then apply a non-convex penalty (NCP) approach to add them to the objective as penalty terms, leading to a problem that is efficiently solvable.

Clustering

Parallel Successive Convex Approximation for Nonsmooth Nonconvex Optimization

1 code implementation NeurIPS 2014 Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo, Jong-Shi Pang

In this work, we propose an inexact parallel BCD approach where at each iteration, a subset of the variables is updated in parallel by minimizing convex approximations of the original objective function.

Optimization and Control

Cannot find the paper you are looking for? You can Submit a new open access paper.