Tighter error bounds for representation learning and lifelong learning
表征学习和终身学习的更严格的误差范围
基本信息
- 批准号:RGPIN-2018-03942
- 负责人:
- 金额:$ 2.84万
- 依托单位:
- 依托单位国家:加拿大
- 项目类别:Discovery Grants Program - Individual
- 财政年份:2019
- 资助国家:加拿大
- 起止时间:2019-01-01 至 2020-12-31
- 项目状态:已结题
- 来源:
- 关键词:
项目摘要
The success of machine learning algorithms crucially hinges on which numerical features are used to represent data. An arguably large part of the success of human learning is that we not only learn representations to perform well on prediction tasks, but we also reuse these representations to more efficiently learn newly encountered but similar tasks. We are now in an era where "deep" machine learning methods actually learn useful representations of data automatically. These deep learning methods are becoming vital to many other fields: just a few successful applications include drug design, 3D rendering for computer graphics, and beating top-level human players in games such as Go. Despite these great empirical successes, our mathematical understanding for why these methods work well and how to best train them is lacking. ******Part I of my research is to develop new theory to understand how well a deep model will perform when it makes predictions about new data. My strategy to obtain better performance guarantees is to use theory that leverages specific properties of the actual data an algorithm sees and specific properties of the algorithm itself. By considering both of these important aspects of training, I expect to achieve success for deep learning models as well. Another important part of my analysis is to answer the following question: If a deep learning model is insensitive to certain types of transformations of its input, can it successfully be trained using less data as a result?******One of the greatest advancements the field of machine learning can make is to shift from learning each new thing in isolation to reusing what has been learned in the past when learning new tasks. This continual transfer when learning an endless sequence of tasks is known as lifelong learning. While some research has begun in this important area, the mathematical theory for how well algorithms can perform lifelong learning is lacking, especially with regards to adaptive algorithms that transfer much more from their past experiences when they encounter tasks that are highly similar to past tasks. ******Part II of my research is to design algorithms for lifelong learning, including developing mathematical guarantees for these algorithms. I aim to answer questions like the following: If a learning agent encounters a series of slowly changing learning tasks, can we pool the data from previous tasks in order to learn new tasks using much less data? My strategy will be to adapt powerful ideas from sequential prediction, a vital yet previously untapped resource for work in lifelong learning.******Both parts of this work can fundamentally advance the field of machine learning, which already is revolutionizing a number of sciences and industries. The students participating in this research will be excellently-equipped to fuel Canada's technological contributions at the global stage.
机器学习算法的成功关键取决于使用哪些数值特征来表示数据。人类学习成功的很大一部分可以说是我们不仅学习表示来在预测任务中表现良好,而且我们还重用这些表示来更有效地学习新遇到的但类似的任务。我们现在处于一个“深度”机器学习方法实际上自动学习数据的有用表示的时代。这些深度学习方法对许多其他领域变得至关重要:只有少数成功的应用包括药物设计,计算机图形的3D渲染,以及在围棋等游戏中击败顶级人类玩家。尽管这些巨大的经验成功,我们的数学理解,为什么这些方法的工作以及如何最好地训练他们是缺乏的。****** 我的研究的第一部分是开发新的理论,以了解深度模型在对新数据进行预测时的表现。我获得更好性能保证的策略是使用理论,该理论利用算法看到的实际数据的特定属性和算法本身的特定属性。通过考虑训练的这两个重要方面,我希望深度学习模型也能取得成功。我的分析的另一个重要部分是回答以下问题:如果深度学习模型对其输入的某些类型的转换不敏感,那么它是否可以使用更少的数据成功地进行训练?机器学习领域可以取得的最大进步之一是从孤立地学习每一个新事物转变为在学习新任务时重用过去学到的东西。在学习无休止的一系列任务时,这种持续的迁移被称为终身学习。虽然在这一重要领域已经开始了一些研究,但缺乏算法如何进行终身学习的数学理论,特别是关于自适应算法,当它们遇到与过去任务高度相似的任务时,它们会从过去的经验中转移更多。** 我研究的第二部分是设计终身学习的算法,包括为这些算法开发数学保证。我的目标是回答这样的问题:如果一个学习代理遇到一系列缓慢变化的学习任务,我们是否可以从以前的任务中汇集数据,以便使用更少的数据学习新任务?我的策略将是从序列预测中采纳强有力的想法,这是终身学习工作中一个重要但以前尚未开发的资源。这项工作的两个部分都可以从根本上推动机器学习领域的发展,机器学习已经彻底改变了许多科学和行业。参加这项研究的学生将有能力在全球舞台上推动加拿大的技术贡献。
项目成果
期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)
数据更新时间:{{ journalArticles.updateTime }}
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
数据更新时间:{{ journalArticles.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ monograph.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ sciAawards.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ conferencePapers.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ patent.updateTime }}
Mehta, Nishant其他文献
Knowledge regarding Ebola Hemorrhagic Fever among private dental practitioners in Tricity, India: A cross-sectional questionnaire study.
- DOI:
10.4103/0300-1652.153405 - 发表时间:
2015-03-01 - 期刊:
- 影响因子:0
- 作者:
Gupta, Nidhi;Mehta, Nishant;Setia, Priyanka - 通讯作者:
Setia, Priyanka
Structure and Functional Binding Epitope of V-domain Ig Suppressor of T Cell Activation
- DOI:
10.1016/j.celrep.2019.07.073 - 发表时间:
2019-09-03 - 期刊:
- 影响因子:8.8
- 作者:
Mehta, Nishant;Maddineni, Sainiteesh;Cochran, Jennifer R. - 通讯作者:
Cochran, Jennifer R.
An engineered antibody binds a distinct epitope and is a potent inhibitor of murine and human VISTA
- DOI:
10.1038/s41598-020-71519-4 - 发表时间:
2020-09-16 - 期刊:
- 影响因子:4.6
- 作者:
Mehta, Nishant;Maddineni, Sainiteesh;Cochran, Jennifer R. - 通讯作者:
Cochran, Jennifer R.
Enhanced safety and efficacy of protease-regulated CAR-T cell receptors.
- DOI:
10.1016/j.cell.2022.03.041 - 发表时间:
2022-05-12 - 期刊:
- 影响因子:64.5
- 作者:
Labanieh, Louai;Majzner, Robbie G.;Klysz, Dorota;Sotillo, Elena;Fisher, Chris J.;Vilches-Moure, Jose G.;Pacheco, Kaithlen Zen B.;Malipatlolla, Meena;Xu, Peng;Hui, Jessica H.;Murty, Tara;Theruvath, Johanna;Mehta, Nishant;Yamada-Hunter, Sean A.;Weber, Evan W.;Heitzeneder, Sabine;Parker, Kevin R.;Satpathy, Ansuman T.;Chang, Howard Y.;Lin, Michael Z.;Cochran, Jennifer R.;Mackall, Crystal L. - 通讯作者:
Mackall, Crystal L.
IgGA: A "Cross-Isotype" Engineered Human Fc Antibody Domain that Displays Both IgG-like and IgA-like Effector Functions
- DOI:
10.1016/j.chembiol.2014.10.017 - 发表时间:
2014-12-18 - 期刊:
- 影响因子:0
- 作者:
Kelton, William;Mehta, Nishant;Georgiou, George - 通讯作者:
Georgiou, George
Mehta, Nishant的其他文献
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
{{ truncateString('Mehta, Nishant', 18)}}的其他基金
Tighter error bounds for representation learning and lifelong learning
表征学习和终身学习的更严格的误差范围
- 批准号:
RGPIN-2018-03942 - 财政年份:2022
- 资助金额:
$ 2.84万 - 项目类别:
Discovery Grants Program - Individual
Tighter error bounds for representation learning and lifelong learning
表征学习和终身学习的更严格的误差范围
- 批准号:
RGPIN-2018-03942 - 财政年份:2021
- 资助金额:
$ 2.84万 - 项目类别:
Discovery Grants Program - Individual
Tighter error bounds for representation learning and lifelong learning
表征学习和终身学习的更严格的误差范围
- 批准号:
RGPIN-2018-03942 - 财政年份:2020
- 资助金额:
$ 2.84万 - 项目类别:
Discovery Grants Program - Individual
Tighter error bounds for representation learning and lifelong learning
表征学习和终身学习的更严格的误差范围
- 批准号:
RGPIN-2018-03942 - 财政年份:2018
- 资助金额:
$ 2.84万 - 项目类别:
Discovery Grants Program - Individual
Tighter error bounds for representation learning and lifelong learning
表征学习和终身学习的更严格的误差范围
- 批准号:
DGECR-2018-00412 - 财政年份:2018
- 资助金额:
$ 2.84万 - 项目类别:
Discovery Launch Supplement
相似国自然基金
基于Laplace Error惩罚函数的变量选择方法及其在全基因组关联分析中的应用
- 批准号:11001280
- 批准年份:2010
- 资助金额:17.0 万元
- 项目类别:青年科学基金项目
低辐射空间环境下商用多核处理器层次化软件容错技术研究
- 批准号:90818016
- 批准年份:2008
- 资助金额:50.0 万元
- 项目类别:重大研究计划
伪随机序列的设计与分析
- 批准号:60802029
- 批准年份:2008
- 资助金额:20.0 万元
- 项目类别:青年科学基金项目
随机系统的递推辨识和优化
- 批准号:60474004
- 批准年份:2004
- 资助金额:22.0 万元
- 项目类别:面上项目
支持IP网视频传输的应用层多时间尺度QoS控制
- 批准号:60372019
- 批准年份:2003
- 资助金额:6.0 万元
- 项目类别:面上项目
相似海外基金
Towards new classes of conic optimization problems
迈向新类别的二次曲线优化问题
- 批准号:
23K16844 - 财政年份:2023
- 资助金额:
$ 2.84万 - 项目类别:
Grant-in-Aid for Early-Career Scientists
Tighter error bounds for representation learning and lifelong learning
表征学习和终身学习的更严格的误差范围
- 批准号:
RGPIN-2018-03942 - 财政年份:2022
- 资助金额:
$ 2.84万 - 项目类别:
Discovery Grants Program - Individual
Roots of Polynomials over Infinite Rings with Applications to Cryptography: Investigating Solvability of and Approximation Tools for Polynomial Roots and the Error Bounds of Approximations Used in Rep
无限环上多项式的根及其在密码学中的应用:研究多项式根的可解性和近似工具以及表示中使用的近似的误差界
- 批准号:
544226-2019 - 财政年份:2021
- 资助金额:
$ 2.84万 - 项目类别:
Vanier Canada Graduate Scholarship Tri-Council - Doctoral 3 years
Tighter error bounds for representation learning and lifelong learning
表征学习和终身学习的更严格的误差范围
- 批准号:
RGPIN-2018-03942 - 财政年份:2021
- 资助金额:
$ 2.84万 - 项目类别:
Discovery Grants Program - Individual
Roots of Polynomials over Infinite Rings with Applications to Cryptography: Investigating Solvability of and Approximation Tools for Polynomial Roots and the Error Bounds of Approximations Used in Rep
无限环上多项式的根及其在密码学中的应用:研究多项式根的可解性和近似工具以及表示中使用的近似的误差界
- 批准号:
544226-2019 - 财政年份:2020
- 资助金额:
$ 2.84万 - 项目类别:
Vanier Canada Graduate Scholarship Tri-Council - Doctoral 3 years
Singularities and Error Bounds for Hyperbolic Equations
双曲方程的奇点和误差界
- 批准号:
2006884 - 财政年份:2020
- 资助金额:
$ 2.84万 - 项目类别:
Standard Grant
Tighter error bounds for representation learning and lifelong learning
表征学习和终身学习的更严格的误差范围
- 批准号:
RGPIN-2018-03942 - 财政年份:2020
- 资助金额:
$ 2.84万 - 项目类别:
Discovery Grants Program - Individual
Online-to-Batch Conversion of Adaptive Regret Bounds for Neural Network Generalization Error
神经网络泛化误差自适应遗憾界限的在线批量转换
- 批准号:
546438-2019 - 财政年份:2019
- 资助金额:
$ 2.84万 - 项目类别:
Canadian Graduate Scholarships Foreign Study Supplements
Roots of Polynomials over Infinite Rings with Applications to Cryptography: Investigating Solvability of and Approximation Tools for Polynomial Roots and the Error Bounds of Approximations Used in Rep
无限环上多项式的根及其在密码学中的应用:研究多项式根的可解性和近似工具以及表示中使用的近似的误差界
- 批准号:
544226-2019 - 财政年份:2019
- 资助金额:
$ 2.84万 - 项目类别:
Vanier Canada Graduate Scholarship Tri-Council - Doctoral 3 years
Solving ill-posed conic optimization problems
解决不适定圆锥优化问题
- 批准号:
19K20217 - 财政年份:2019
- 资助金额:
$ 2.84万 - 项目类别:
Grant-in-Aid for Early-Career Scientists














{{item.name}}会员




