Update README.md
Browse files
README.md
CHANGED
@@ -1,3 +1,60 @@
|
|
1 |
-
---
|
2 |
-
license: mit
|
3 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
---
|
2 |
+
license: mit
|
3 |
+
task_categories:
|
4 |
+
- text-classification
|
5 |
+
language:
|
6 |
+
- en
|
7 |
+
tags:
|
8 |
+
- AI
|
9 |
+
- NIPS
|
10 |
+
- NIPS2021
|
11 |
+
---
|
12 |
+
## Neural Information Processing Systems NeurIPS 2021 Accepted Paper Meta Info Dataset
|
13 |
+
|
14 |
+
This dataset is collected from the NeurIPS 2021 Advances in Neural Information Processing Systems 35 conference accepted paper (https://papers.nips.cc/paper_files/paper/2021) as well as the arxiv website DeepNLP paper arxiv (http://www.deepnlp.org/content/paper/nips2021). For researchers who are interested in doing analysis of NIPS 2021 accepted papers and potential research trends, you can use the already cleaned up json file in the dataset. Each row contains the meta information of a paper in the NIPS 2021 conference. To explore more AI & Robotic papers (NIPS/ICML/ICLR/IROS/ICRA/etc) and AI equations, feel free to navigate the Equation Search Engine (http://www.deepnlp.org/search/equation) as well as the AI Agent Search Engine to find the deployed AI Apps and Agents (http://www.deepnlp.org/search/agent) in your domain.
|
15 |
+
|
16 |
+
|
17 |
+
### Meta Information of Json File
|
18 |
+
|
19 |
+
```
|
20 |
+
{
|
21 |
+
"title": "Backward-Compatible Prediction Updates: A Probabilistic Approach",
|
22 |
+
"url": "https://papers.nips.cc/paper_files/paper/2021/hash/012d9fe15b2493f21902cd55603382ec-Abstract.html",
|
23 |
+
"authors": "Frederik Tr\u00e4uble, Julius von K\u00fcgelgen, Matth\u00e4us Kleindessner, Francesco Locatello, Bernhard Sch\u00f6lkopf, Peter Gehler",
|
24 |
+
"detail_url": "https://papers.nips.cc/paper_files/paper/2021/hash/012d9fe15b2493f21902cd55603382ec-Abstract.html",
|
25 |
+
"tags": "NIPS 2021",
|
26 |
+
"Bibtex": "https://papers.nips.cc/paper_files/paper/11633-/bibtex",
|
27 |
+
"Paper": "https://papers.nips.cc/paper_files/paper/2021/file/012d9fe15b2493f21902cd55603382ec-Paper.pdf",
|
28 |
+
"Reviews And Public Comment \u00bb": "https://papers.nips.cchttps://openreview.net/forum?id=YjZoWjTKYvH",
|
29 |
+
"Supplemental": "https://papers.nips.cc/paper_files/paper/2021/file/012d9fe15b2493f21902cd55603382ec-Supplemental.pdf",
|
30 |
+
"abstract": "When machine learning systems meet real world applications, accuracy is only one of several requirements. In this paper, we assay a complementary perspective originating from the increasing availability of pre-trained and regularly improving state-of-the-art models. While new improved models develop at a fast pace, downstream tasks vary more slowly or stay constant. Assume that we have a large unlabelled data set for which we want to maintain accurate predictions. Whenever a new and presumably better ML models becomes available, we encounter two problems: (i) given a limited budget, which data points should be re-evaluated using the new model?; and (ii) if the new predictions differ from the current ones, should we update? Problem (i) is about compute cost, which matters for very large data sets and models. Problem (ii) is about maintaining consistency of the predictions, which can be highly relevant for downstream applications; our demand is to avoid negative flips, i.e., changing correct to incorrect predictions. In this paper, we formalize the Prediction Update Problem and present an efficient probabilistic approach as answer to the above questions. In extensive experiments on standard classification benchmark data sets, we show that our method outperforms alternative strategies along key metrics for backward-compatible prediction updates."
|
31 |
+
}
|
32 |
+
|
33 |
+
```
|
34 |
+
|
35 |
+
|
36 |
+
## Related
|
37 |
+
|
38 |
+
## AI Agent Marketplace and Search
|
39 |
+
[AI Agent Marketplace and Search](http://www.deepnlp.org/search/agent) <br>
|
40 |
+
[Robot Search](http://www.deepnlp.org/search/robot) <br>
|
41 |
+
[Equation and Academic search](http://www.deepnlp.org/search/equation) <br>
|
42 |
+
[AI & Robot Comprehensive Search](http://www.deepnlp.org/search) <br>
|
43 |
+
[AI & Robot Question](http://www.deepnlp.org/question) <br>
|
44 |
+
[AI & Robot Community](http://www.deepnlp.org/community) <br>
|
45 |
+
[AI Agent Marketplace Blog](http://www.deepnlp.org/blog/ai-agent-marketplace-and-search-portal-reviews-2025) <br>
|
46 |
+
|
47 |
+
## AI Agent Reviews
|
48 |
+
[AI Agent Marketplace Directory](http://www.deepnlp.org/store/ai-agent) <br>
|
49 |
+
[Microsoft AI Agents Reviews](http://www.deepnlp.org/store/pub/pub-microsoft-ai-agent) <br>
|
50 |
+
[Claude AI Agents Reviews](http://www.deepnlp.org/store/pub/pub-claude-ai-agent) <br>
|
51 |
+
[OpenAI AI Agents Reviews](http://www.deepnlp.org/store/pub/pub-openai-ai-agent) <br>
|
52 |
+
[Saleforce AI Agents Reviews](http://www.deepnlp.org/store/pub/pub-salesforce-ai-agent) <br>
|
53 |
+
[AI Agent Builder Reviews](http://www.deepnlp.org/store/ai-agent/ai-agent-builder) <br>
|
54 |
+
|
55 |
+
## AI Equation
|
56 |
+
[List of AI Equations and Latex](http://www.deepnlp.org/equation/category/ai) <br>
|
57 |
+
[List of Math Equations and Latex](http://www.deepnlp.org/equation/category/math) <br>
|
58 |
+
[List of Physics Equations and Latex](http://www.deepnlp.org/equation/category/physics) <br>
|
59 |
+
[List of Statistics Equations and Latex](http://www.deepnlp.org/equation/category/statistics) <br>
|
60 |
+
[List of Machine Learning Equations and Latex](http://www.deepnlp.org/equation/category/machine%20learning) <br>
|