AAAI 最佳论文列表(1984→2023最新)附论文下载

明天AAAI全文截稿了,不知道大家的论文投的咋样啦?我不得不提一句,今年的AAAI投稿量又破新高了,快14,000!卷哭...

不过这个投稿量也在意料之中,AAAI属于中国计算机学会CCF的A类国际学术会议,在人工智能领域享有盛誉,去年的录用率更是只有15%,在如此激烈的竞争中脱颖而出,也足以证明自己的实力。

让我们先来看看AAAI今年的会议投稿流程:

 从2019年开始,AAAI的投稿量成倍上升,2018年还是只有3800,到了2022年就猛增到了9020,今年的14,000更是吓人,但逐年下降的录用率也告诉了我们越来越严格的审稿制度和投稿规范要求。为了不被轻易“卷”走,我们要做的依然是不断提高论文的质量。

如何提高论文的质量?你需要知道:想要获得优秀的成果,只靠自己冥思苦想是不行的,研读经典论文有助于我们理清思路,把握重点。许多优秀的ideal都是在前人的研究基础上产生,历年来的最佳论文,就是我们最好的学习对象。

这次我就帮大家整理了AAAI历年来的最佳论文,共67篇(1984→2023)。论文list如下:

最佳论文

2023

Misspecification in Inverse Reinforcement Learning

2022

Online certification of preference-based fairness for personalized recommender systems

2021

Exploration-Exploitation in Multi-Agent Learning: Catastrophe Theory Meets Game Theory

Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting

Mitigating Political Bias in Language Models Through Reinforced Calibration

2020

A Distributed Multi-Sensor Machine Learning Approach to Earthquake Early Warning

WinoGrande: An Adversarial Winograd Schema Challenge at Scale

Fair Division of Mixed Divisible and Indivisible Goods

2019

Zero Shot Learning for Code Education: Rubric Sampling with Deep Learning Inference

How to Combine Tree-Search Methods in Reinforcement Learning

2018

Counterfactual Multi-Agent Policy Gradients

Memory-Augmented Monte Carlo Tree Search

2017

The Option-Critic Architecture

Label-Free Supervision of Neural Networks with Physics and Domain Knowledge

2016

Toward a Taxonomy and Computational Models of Abnormalities in Images

Bidirectional Search That Is Guaranteed to Meet in the Middle

2015

Surpassing Human-Level Face Verification Performance on LFW with GaussianFace

From Non-Negative to General Operator Cost Partitioning

2014

Recovering from Selection Bias in Causal and Statistical Inference

2013

SMILe: Shuffled Multiple-Instance Learning

HC-Search: Learning Heuristics and Cost Functions for Structured Prediction

2012

Learning SVM Classiiers with Indeinite Kernels

Document Summarization Based on Data Reconstruction

2011

Complexity of and Algorithms for Borda Manipulation

Dynamic Resource Allocation in Conservation Planning

2010

How Incomplete Is Your Semantic Web Reasoner?

A Novel Transition Based Encoding Scheme for Planning as Satisfiability

2008

Optimal False-Name-Proof Voting Rules with Costly Voting

How Good is Almost Perfect

2007

PLOW: A Collaborative Task Learning Agent

Thresholded Rewards: Acting Optimally in Timed, Zero-Sum Games

2006

Model Counting: A New Strategy for Obtaining Good Bounds

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

The Interactive Museum Tour-Guide Robot

Learning Evaluation Functions for Global Optimization and Boolean Satisfiability

1997

Statistical Parsing with a Context-Free Grammar and Word Statistics

A Practical Algorithm for Finding Optimal Triangulations

Building Concept Representations from Reusable Components

Fast Context Switching in Real-Time Propositional Reasoning

1996

Verification of Knowledge Bases Based on Containment Checking

A Novel Application of Theory Refinement to Student Modeling

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

Approach to Qualitative Algebraic Reasoning

1987

An Approach to Default Reasoning Based on a First-Order Conditional Logic

PROMPT: An Innovative Design Tool

Curing Anomalous Extensions

Non-Deterministic Lisp with Dependency-directed Backtracking

Defining Operationality for Explanation-based Learning

Word-Order Variation in Natural Language Generation

Energy Constraints on Deformable Models: Recovering Shape and Non-Rigid Motion

Incremental Causal Reasoning

1986

Default Reasoning, Nonmonotonic Logics, and the Frame Problem

Generating Tests by Exploiting Designed Behavior

1984

The Tractability of Subsumption in Frame-Based Description Languages

Choices without Backtracking

A Logic of Implicit and Explicit Belief

Shading into Texture

关注下方《学姐带你玩AI》🚀🚀🚀

回复“AAAI”获取最佳论文+代码合集

码字不易,欢迎大家点赞评论收藏!

### 关于AAA AI 2024会议论文 AAAI-24会议定于2024年2月20日至2月27日举行[^1]。要查找与该会议相关的论文,通常可以通过以下几种方式获取: #### 官方网站 访问官方发布的会议页面通常是了解最新动态的最佳途径。尽管目前尚未提供具体链接,但可以预期的是,在接近会议日期前几个月,主办方会发布详细的议程以及接受的论文列表。 #### 数据库和索引服务 利用学术搜索引擎如Google Scholar、Microsoft Academic或者专门针对计算机科学领域的内容平台DBLP,输入关键词“AAAI 2024”可以帮助定位相关研究工作。这些工具能够快速筛选并展示匹配的结果。 #### 开放评审系统 部分顶级人工智能会议采用开放同行评议机制(例如ICLR曾使用的OpenReview平台[^2]),允许公众查看提交的手稿及其审阅过程记录。如果AAAI延续这一做法,则意味着潜在参与者可以直接在线浏览候选贡献项。 以下是基于Python实现的一个简单脚本用于自动化查询特定时间段内的出版物信息: ```python import requests from bs4 import BeautifulSoup def fetch_papers(year, conf_name="aaai"): base_url = f"https://www.{conf_name}.org/" response = requests.get(f"{base_url}proceedings/{year}") soup = BeautifulSoup(response.text, 'html.parser') titles = [] for item in soup.select('.paper-title'): title=item.string.strip() if not any(c.isdigit()for c in title): # filter out non-paper entries like headers etc. titles.append(title) return titles[:min(len(titles),10)] if __name__ == "__main__": year='2024' print(fetch_papers(year)) ``` 此代码片段仅作为演示用途;实际应用时需确认目标站点支持爬取操作,并遵循其robots.txt文件规定。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值