卷，AAAI 2024 的投稿量接近14,000了！
導(dǎo)讀
今天不經(jīng)意間看到這么一個(gè)激動(dòng)人心的數(shù)字，此刻只能用一個(gè)字表達(dá)內(nèi)心的感受："卷"！為此，小編默默打開塵封許久的 CMT 后臺。。。
只能說要換成今年投稿，可能只有1篇能中，又或者全軍覆沒？國內(nèi)這行情，現(xiàn)在無論是考公、考研、考教師編，亦或者送外賣、做網(wǎng)約車司機(jī)等，處處卷上天?？赡苓@個(gè)時(shí)代最利好的人群便是整天“販賣焦慮”轉(zhuǎn)手又“賣服務(wù)”給你的那群人，把流量賺足了再順便把你給收割了，留下一片綠油油的韭菜田子。。。
作為一名初入自媒體創(chuàng)作的新手，奶蓋一直堅(jiān)持利用工作學(xué)習(xí)之余的業(yè)余時(shí)間進(jìn)行創(chuàng)作無私分享給大家，不求質(zhì)量超群，只求問心無愧，做人還是要堅(jiān)持底線?，F(xiàn)在也慢慢察覺到，以前一些經(jīng)常關(guān)注的技術(shù)號，現(xiàn)在幾乎都淪陷成營銷號了，實(shí)屬可惜，可能這也是如今大內(nèi)卷時(shí)代必然的產(chǎn)物。然而，筆者仍希望能在這個(gè)浮躁的社會(huì)風(fēng)氣下，保持初心，堅(jiān)持創(chuàng)作。誰也不能預(yù)知未來會(huì)什么事情，可能某一天也停筆了，但人最重要的還是要活在當(dāng)下，畢竟人生是一段旅程，在旅行中遇到的每一個(gè)人，做的每一件事，看過的每一個(gè)美麗景色，都有可能成為一生中難忘的回憶。
回到正文，投稿數(shù)量的激增會(huì)帶來很多問題，顯而易見的便是審稿人數(shù)量不足、工作量激增、部分審稿人資質(zhì)不足等。當(dāng)然，這不是我們應(yīng)該考慮的問題，作為一名科(磕)研(鹽)人(汪)，我們首要掌握的核心秘訣便是——斐波那契投稿法?？梢哉f，自從有了斐波那契投稿法，爸爸媽媽再也不用擔(dān)心我們沒有論文了。
斐波那契投稿法：
本次投稿的文章 = 上次被拒的文章 + 上上次被拒的文章
該法則得以成立的一個(gè)前提條件便是：“只要投出去的論文，總會(huì)在某一處被接收”。下面簡單附上本屆 AAAI 會(huì)議的相關(guān)信息以及往年的一些統(tǒng)計(jì)數(shù)據(jù)，希望大家都能有所收獲。
會(huì)議信息
AAAI 2024: AAAI Conference on Artificial Intelligence
| 日期 | 事件 |
|---|---|
| 2023.07.04 | AAAI-24 網(wǎng)站開放作者注冊 |
| 2023.07.11 | AAAI-24 網(wǎng)站開放論文提交 |
| 2023.08.08 | 截止日期：摘要提交（UTC-12 時(shí)區(qū)） |
| 2023.08.15 | 截止日期：完整論文提交（UTC-12 時(shí)區(qū)） |
| 2023.08.18 | 截止日期：補(bǔ)充材料和代碼提交（UTC-12 時(shí)區(qū)） |
| 2023.09.25 | 截止日期：NeurIPS 快速通道提交的注冊、摘要和完整論文（UTC-12 時(shí)區(qū)） |
| 2023.09.27 | 第一階段拒絕通知 |
| 2023.09.28 | 截止日期：NeurIPS 快速通道提交的補(bǔ)充材料和代碼（UTC-12 時(shí)區(qū)） |
| 2023.11.02-05 | 作者反饋窗口 |
| 2023.12.09 | 最終錄取或拒絕通知 |
| 2023.12.19 | 提交論文預(yù)印本以包含在電子會(huì)議材料中 |
| 2024.02.20-27 | AAAI-24 會(huì)議 |
今年 AAAI 也對使用 LLM 做出了相應(yīng)規(guī)定：
-
不允許提交包含如ChatGPT這類大型語言模型（LLM）生成的文本的論文，除非這些文本是作為論文實(shí)驗(yàn)分析的一部分。 -
但可以使用LLM進(jìn)行文本的編輯或潤色。 -
根據(jù)AAAI的政策，任何AI系統(tǒng)（包括Chat-GPT、BARD、DALL-E等生成模型）不滿足AAAI論文的作者資格，也不能作為AAAI論文的可引用來源。作者需對內(nèi)容承擔(dān)全部責(zé)任，包括檢查抄襲和文本的真實(shí)性
同往年一樣，今年依舊采用雙階段評審：第一階段兩次評審，第一階段未被拒絕的論文在第二階段進(jìn)行額外評審。僅第一階段未被拒絕的論文在第二階段后有作者回應(yīng)。
錄用率
| 年份 | 提交數(shù) | 錄取數(shù) | 錄取率(%) |
|---|---|---|---|
| 2022 | 9020 | 1349 | 15% |
| 2021 | 7911 | 1692 | 21.4% |
| 2020 | 7737 | 1591 | 20.6% |
| 2019 | 7095 | 1150 | 16.2% |
| 2018 | 3800 | 933 | 24.6% |
| 2017 | 2590 | 638 | 24.6% |
| 2016 | 2132 | 549 | 25.8% |
| 2015 | 1991 | 531 | 26.7% |
| 2014 | 1406 | 398 | 28.3% |
| 2011 | 975 | 242 | 24.8% |
| 2010 | 982 | 264 | 26.9% |
| 2008 | 937 | 227 | 24.2% |
| 2007 | 921 | 253 | 27.5% |
| 2006 | 774 | 171 | 22.1% |
| 2005 | 803 | 148 | 18.4% |
| 2004 | 453 | 121 | 26.7% |
| 2002 | 469 | 121 | 25.8% |
| 2000 | 431 | 143 | 33.2% |
| 1999 | 400 | 109 | 27.3% |
| 1998 | 475 | 144 | 30.3% |
| 1997 | 323 | 117 | 36.2% |
| 1996 | 643 | 197 | 30.6% |
| 1994 | 780 | 222 | 28.5% |
| 1993 | 524 | 126 | 24% |
| 1992 | 636 | 133 | 20.9% |
| 1991 | 603 | 142 | 23.5% |
| 1990 | 892 | 161 | 18% |
| 1988 | 850 | 148 | 17.4% |
| 1987 | 715 | 149 | 20.8% |
| 1986 | 817 | 187 | 22.9% |
往年最佳論文
| 年份 | 最佳論文 |
|---|---|
| 2022 | Online certification of preference-based fairness for personalized recommender systems |
| 2021 | Exploration-Exploitation in Multi-Agent Learning: Catastrophe Theory Meets Game Theory |
| 2021 | Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting |
| 2021 | Mitigating Political Bias in Language Models Through Reinforced Calibration |
| 2020 | A Distributed Multi-Sensor Machine Learning Approach to Earthquake Early Warning |
| 2020 | WinoGrande: An Adversarial Winograd Schema Challenge at Scale |
| 2020 | Fair Division of Mixed Divisible and Indivisible Goods |
| 2019 | Zero Shot Learning for Code Education: Rubric Sampling with Deep Learning Inference |
| 2019 | How to Combine Tree-Search Methods in Reinforcement Learning |
| 2018 | Counterfactual Multi-Agent Policy Gradients |
| 2018 | Memory-Augmented Monte Carlo Tree Search |
| 2017 | The Option-Critic Architecture |
| 2017 | Label-Free Supervision of Neural Networks with Physics and Domain Knowledge |
| 2016 | Toward a Taxonomy and Computational Models of Abnormalities in Images |
| 2016 | Bidirectional Search That Is Guaranteed to Meet in the Middle |
| 2015 | Surpassing Human-Level Face Verification Performance on LFW with GaussianFace |
| 2015 | From Non-Negative to General Operator Cost Partitioning |
| 2014 | Recovering from Selection Bias in Causal and Statistical Inference |
| 2013 | SMILe: Shuf?ed Multiple-Instance Learning |
| 2013 | HC-Search: Learning Heuristics and Cost Functions for Structured Prediction |
| 2012 | Learning SVM Classiiers with Indeinite Kernels |
| 2012 | Document Summarization Based on Data Reconstruction |
| 2011 | Complexity of and Algorithms for Borda Manipulation |
| 2011 | Dynamic Resource Allocation in Conservation Planning |
| 2010 | How Incomplete Is Your Semantic Web Reasoner? |
| 2010 | A Novel Transition Based Encoding Scheme for Planning as Satisfiability |
| 2008 | Optimal False-Name-Proof Voting Rules with Costly Voting |
| 2008 | How Good is Almost Perfect? |
| 2007 | PLOW: A Collaborative Task Learning Agent |
| 2007 | Thresholded Rewards: Acting Optimally in Timed, Zero-Sum Games |
| 2006 | Model Counting: A New Strategy for Obtaining Good Bounds |
| 2006 | Towards an Axiom System for Default Logic |
| 2005 | The Max K-Armed Bandit: A New Model of Exploration Applied to Search Heuristic Selection |
| 2004 | Learning and Inferring Transportation Routines |
| 2002 | On Computing all Abductive Explanations |
| 2000 | The Game of Hex: An Automatic Theorem Proving Approach to Game Programming |
| 1999 | PROVERB: The Probabilistic Cruciverbalist |
| 1998 | Acceleration Methods for Numeric CSPs |
| 1998 | The Interactive Museum Tour-Guide Robot |
| 1998 | Learning Evaluation Functions for Global Optimization and Boolean Satisfiability |
| 1997 | Statistical Parsing with a Context-Free Grammar and Word Statistics |
| 1997 | A Practical Algorithm for Finding Optimal Triangulations |
| 1997 | Building Concept Representations from Reusable Components |
| 1997 | Fast Context Switching in Real-Time Propositional Reasoning |
| 1996 | Verification of Knowledge Bases Based on Containment Checking |
| 1996 | A Novel Application of Theory Refinement to Student Modeling |
| 1996 | Pushing the Envelope: Planning, Propositional Logic and Stochastic Search |
| 1994 | A Prototype Reading Coach that Listens |
| 1993 | Equations for Part-of-Speech Tagging |
| 1992 | Hard and Easy Distributions of SAT Problems |
| 1991 | Improving Rule-Based Systems Through Case-Based Reasoning |
| 1988 | Qualitative Results Concerning the Utility of Explanation-Based Learning |
| 1988 | Approach to Qualitative Algebraic Reasoning |
| 1987 | An Approach to Default Reasoning Based on a First-Order Conditional Logic |
| 1987 | PROMPT: An Innovative Design Tool |
| 1987 | Curing Anomalous Extensions |
| 1987 | Non-Deterministic Lisp with Dependency-directed Backtracking |
| 1987 | Defining Operationality for Explanation-based Learning |
| 1987 | Word-Order Variation in Natural Language Generation |
| 1987 | Energy Constraints on Deformable Models: Recovering Shape and Non-Rigid Motion |
| 1987 | Incremental Causal Reasoning |
| 1986 | Default Reasoning, Nonmonotonic Logics, and the Frame Problem |
| 1986 | Generating Tests by Exploiting Designed Behavior |
| 1984 | The Tractability of Subsumption in Frame-Based Description Languages |
| 1984 | Choices without Backtracking |
| 1984 | A Logic of Implicit and Explicit Belief |
| 1984 | Shading into Texture |
未完，待續(xù)。
來源：CVHub
評論
圖片
表情