Optimal computational and statistical rates of convergence for sparse nonconvex learning problems (Q482875): Difference between revisions

@@ Property / author @@
+Han Liu
@@ Property / author: Han Liu / rank @@
+Normal rank
@@ Property / author @@
+Tong Zhang
@@ Property / author: Tong Zhang / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+F30
@@ Property / Mathematics Subject Classification ID: 62F30 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C26
@@ Property / Mathematics Subject Classification ID: 90C26 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+J12
@@ Property / Mathematics Subject Classification ID: 62J12 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C52
@@ Property / Mathematics Subject Classification ID: 90C52 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6383648
@@ Property / zbMATH DE Number: 6383648 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+nonconvex regularized \(M\)-estimation
@@ Property / zbMATH Keywords: nonconvex regularized \(M\)-estimation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+path-following method
@@ Property / zbMATH Keywords: path-following method / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+geometric computational rate
@@ Property / zbMATH Keywords: geometric computational rate / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+optimal statistical rate
@@ Property / zbMATH Keywords: optimal statistical rate / rank @@
+Normal rank

Revision as of 19:45, 30 June 2023