ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 0804.3835
  4. Cited By
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in
  Machine Learning
v1v2v3v4v5 (latest)

A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning

Journal of machine learning research (JMLR), 2008
24 April 2008
Jin Yu
S.V.N. Vishwanathan
Simon Günter
N. Schraudolph
ArXiv (abs)PDFHTML

Papers citing "A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning"

12 / 12 papers shown
A fast algorithm for solving the lasso problem exactly without homotopy using differential inclusions
A fast algorithm for solving the lasso problem exactly without homotopy using differential inclusions
G. P. Langlois
Jérome Darbon
221
0
0
08 Jul 2025
Novel and Efficient Approximations for Zero-One Loss of Linear
  Classifiers
Novel and Efficient Approximations for Zero-One Loss of Linear Classifiers
Hiva Ghanbari
Minhan Li
K. Scheinberg
115
1
0
28 Feb 2019
Newton-Type Methods for Non-Convex Optimization Under Inexact Hessian
  Information
Newton-Type Methods for Non-Convex Optimization Under Inexact Hessian Information
Peng Xu
Farbod Roosta-Khorasani
Michael W. Mahoney
678
222
0
23 Aug 2017
Training L1-Regularized Models with Orthant-Wise Passive Descent
  Algorithms
Training L1-Regularized Models with Orthant-Wise Passive Descent Algorithms
Jianqiao Wangni
255
1
0
26 Apr 2017
A Fast Algorithm for the Coordinate-wise Minimum Distance Estimation
A Fast Algorithm for the Coordinate-wise Minimum Distance Estimation
Jiwoong Kim
52
8
0
09 Feb 2017
CoCoA: A General Framework for Communication-Efficient Distributed
  Optimization
CoCoA: A General Framework for Communication-Efficient Distributed Optimization
Virginia Smith
Simone Forte
Chenxin Ma
Martin Takáč
Sai Li
Martin Jaggi
366
281
0
07 Nov 2016
Nonextensive information theoretical machine
Nonextensive information theoretical machine
Chaobing Song
Shutao Xia
97
0
0
21 Apr 2016
Sub-Sampled Newton Methods II: Local Convergence Rates
Sub-Sampled Newton Methods II: Local Convergence Rates
Farbod Roosta-Khorasani
Michael W. Mahoney
364
85
0
18 Jan 2016
Sub-Sampled Newton Methods I: Globally Convergent Algorithms
Sub-Sampled Newton Methods I: Globally Convergent Algorithms
Farbod Roosta-Khorasani
Michael W. Mahoney
363
94
0
18 Jan 2016
Counterfactual Risk Minimization: Learning from Logged Bandit Feedback
Counterfactual Risk Minimization: Learning from Logged Bandit Feedback
Adith Swaminathan
Thorsten Joachims
OffRL
405
169
0
09 Feb 2015
Proximal Newton-type methods for minimizing composite functions
Proximal Newton-type methods for minimizing composite functionsSIAM Journal on Optimization (SIOPT), 2012
Jason D. Lee
Yuekai Sun
M. Saunders
1.3K
329
0
07 Jun 2012
An Introduction to Conditional Random Fields
An Introduction to Conditional Random Fields
Charles Sutton
Andrew McCallum
AI4CEBDLCMLTPM
330
1,273
0
17 Nov 2010
1
Page 1 of 1