ITR: New directions in clustering and learning
ITR: New directions in clustering and learning
批准号:
0205594
负责人:
Sanjeev Arora
金额:
$0.0万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2002
资助国家:
美国
项目状态:
已结题
起止时间:
2002-10-01 至 2008-09-30
中文摘要
点击翻译按钮获取中文摘要
英文摘要
New directions in clustering and learningFaced with ever-larger amounts of data, researchers, government institutions, corporations and even the general public seek tools that help them deal with large bodies of information, identify patterns in it, learn what thesepatterns mean, and act upon that information in a timely fashion. Developing such tools involves a novel and interesting blend of algorithms, statistics, AI, and machine learning. The project assembles a team of experts (fourfrom academia and two from industry) in these areas to attack an interestingand meaningful subset of such problems which have the general flavor ofclustering or learning.The defining philosophy of this proposal is that no clear boundary Separates the twin notions of clustering and learning. Clustering is usually drivenby the end goal of learning, but can also be viewed as a learning taskin itself since it results in a more compact description of the data.By the same token all learning involves clustering of some sort, andin fact this viewpoint is implicit in recent papers in the learning literature. The project takes an integrated view of the entire problem of learningpatterns in data, starting from streaming computations that might producerepresentative sketches of the data as it streams by, to problems of clustering data into meaninful patterns (with attendant problems of outlier removal,multiobjective optimization etc.), to learning algorithms that fitsophisticated models (SVMs, bayesian nets, gaussian mixtures etc.) for inference and reasoning tasks.The investigators believe that all these disparate algorithmic efforts haveunifying ideas. Furthermore, their synergistic approach throws up severalinteresting ideas of its own that could lead to significant advances. Examples: include using coding theoretic ideas in disparate applications such as Multiclass learning (a broad class of learning problems including text and speech categorization, part-of-speech tagging, gesture recognition etc.) and shape recognitionin vision; the use of clustering ideas to do dimension reduction (offeringan alternative to popular SVD based approaches), and using ideas fromapproximation algorithms and clustering to do near-optimal model fittingfor models such as bayesian nets.The project also includes a management and educational plan that involvesdissemination of the ideas of this research through development of new courses and also pieces of learning software that will be placed in the public domain.Algorithms developed in as part of this project will be tested on large datasets, including those obtained from Google Inc. Some algorithmic ideas will also be implemented in industry (including Google).
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Collaborative Research: RI:Medium:MoDL:Mathematical and Conceptual Understanding of Large Language Models
-
批准号:2211779
-
项目类别:Standard Grant
-
资助金额:$80.0万
-
财政年份:2022
-
负责人:Sanjeev Arora
-
依托单位:
AF: Large: Collaborative Research: Nonconvex Methods and Models for Learning: Toward Algorithms with Provable and Interpretable Guarantees
-
批准号:1704860
-
项目类别:Continuing Grant
-
资助金额:$170.0万
-
财政年份:2017
-
负责人:Sanjeev Arora
-
依托单位:
AF: Small: Linear Algebra++ and applications to machine learning
-
批准号:1527371
-
项目类别:Standard Grant
-
资助金额:$45.0万
-
财政年份:2015
-
负责人:Sanjeev Arora
-
依托单位:
AF: Medium: Towards Provable Bounds for Machine Learning
-
批准号:1302518
-
项目类别:Continuing Grant
-
资助金额:$90.0万
-
财政年份:2013
-
负责人:Sanjeev Arora
-
依托单位:
AF: Small: Expansion, Unique Games, and Efficient Algorithms
-
批准号:1117309
-
项目类别:Standard Grant
-
资助金额:$45.0万
-
财政年份:2011
-
负责人:Sanjeev Arora
-
依托单位:
New Directions in Semidefinite Programming and Approximation
-
批准号:0830673
-
项目类别:Continuing Grant
-
资助金额:$0.0万
-
财政年份:2008
-
负责人:Sanjeev Arora
-
依托单位:
Collaborative Research: Understanding, Coping with, and Benefiting from Intractibility.
-
批准号:0832797
-
项目类别:Continuing Grant
-
资助金额:$686.8万
-
财政年份:2008
-
负责人:Sanjeev Arora
-
依托单位:
New directions in Approximation Algorithms for NP-hard problems
-
批准号:0514993
-
项目类别:Standard Grant
-
资助金额:$20.0万
-
财政年份:2005
-
负责人:Sanjeev Arora
-
依托单位:
Collaborative Research: MSPA-MCS: Embeddings of Finite Metric Spaces - A Geometric Approach to Efficient Algorithms
-
批准号:0528414
-
项目类别:Standard Grant
-
资助金额:$29.0万
-
财政年份:2005
-
负责人:Sanjeev Arora
-
依托单位:
Approximation of NP-Hard Problems: Algorithms and Complexity
-
批准号:0098180
-
项目类别:Standard Grant
-
资助金额:$25.7万
-
财政年份:2001
-
负责人:Sanjeev Arora
-
依托单位:
CAREER: Research into the Hardness of Approximation, Probabilistically Checkable Proofs, and Their Connection to Other Areas
-
批准号:9502747
-
项目类别:Continuing Grant
-
资助金额:$21.95万
-
财政年份:1995
-
负责人:Sanjeev Arora
-
依托单位:
海外基金