课题基金 / 基金详情

EAGER: New Optimization Methods for Machine Learning

EAGER: New Optimization Methods for Machine Learning
EAGER:机器学习的新优化方法
批准号:
1451500
负责人:
Tony Jebara
金额:
$10.0万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2014
资助国家:
美国
项目状态:
已结题
起止时间:
2014-09-01 至 2018-05-31

项目摘要

项目成果

Tony Jebara的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
This proposal explores the optimization of complicated nonlinear equations that underlie machine learning problems by reducing them to simpler easy-to-solve update rules. The learning problems include classification, regression, unsupervised learning and more. Through a method known as majorization, complicated optimization problems are handled by iteratively solving simpler problems like least-squares and traditional linear algebra operations. The proposal focuses on how to parallelize this method so that it can efficiently leverage many CPUs/GPUs simultaneously and in a distributed manner. Furthermore, by making the method stochastic, faster convergence on large or streaming data-sets becomes possible. Other variations are explored such as sparse learning where the recovered solution is forced to be compact which also leads to further efficiency. Increasingly, the vast majority of machine learning problems in the literature are optimized by using generic first- and second-order methods. The approach in this proposal is designed specifically for machine learning optimization problems and uses majorization and bounding to guarantee monotonic convergence. In preliminary work, majorization has produced faster convergence in practice as well as novel theoretical guarantees. To make the method truly viable in practice, this proposal puts forward distributed, parallel, stochastic and sparse extensions. Since such extensions may violate monotonic convergence guarantees, the proposal explores additional algorithmic and theoretical efforts to preserve guarantees while also obtaining fast algorithms. In particular, parallelization and distributed computation is performed by wrapping current state-of-the-art least squares solvers with bound majorization steps. Stochastic computation is explored using singleton, small-batch and variable-sized batch methods. Sparsity is achieved by iterating current large-scale sparse solvers like FISTA and QUIC within the bound majorization technique. In terms of broader impact, one graduate student will be supported and will help produce downloadable tools for machine learning experts as well as practitioners. Modules will be developed to add to the PI's existing courses in machine learning. The PI will organize a one-day workshop on majorization methods. The proposal also provides a public project website with access to research publications, software/data downloads and schedules of upcoming events.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
III: Small: Collaborative Research: Approximate Learning and Inference in Graphical Models
  • 批准号:
    1526914
  • 项目类别:
    Standard Grant
  • 资助金额:
    $16.41万
  • 财政年份:
    2015
  • 负责人:
    Tony Jebara
  • 依托单位:
RI: Small: Learning and Inference with Perfect Graphs
  • 批准号:
    1117631
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $44.94万
  • 财政年份:
    2011
  • 负责人:
    Tony Jebara
  • 依托单位:
CAREER: Discriminative and Generative Machine Learning with Applications in Tracking and Gesture Recogniton
  • 批准号:
    0347499
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $0.0万
  • 财政年份:
    2004
  • 负责人:
    Tony Jebara
  • 依托单位:
ITR: Representation Learning: Transformations and Kernels for Collections of Tuples
  • 批准号:
    0312690
  • 项目类别:
    Standard Grant
  • 资助金额:
    $24.02万
  • 财政年份:
    2003
  • 负责人:
    Tony Jebara
  • 依托单位:
海外基金