Spain

ECAI 2020

Improving Unsupervised Domain Adaptation with Variational Information Bottleneck

domain adaptation; information bottleneck; computer vision

### Welcome to ACL 2023, the 61st Annual Meeting of the Association for Computational Linguistics! 
 The conference will be held in Toronto, Canada, July 9-14, 2023. 
Following the succession of the recent conferences in our field, ACL 2023 will adopt a hybrid format.
While the impact of Covid has considerably diminished in terms of traveling, obtaining visas to Canada
entails a very long process. Moreover, the global economic conditions pose challenges for many individuals to travel to conferences. Recognizing these circumstances, we know many participants may not be
able to attend the conference in person. Therefore, we are committed to providing a great virtual platform
so everyone has the opportunity to interact with other participants and enjoy the conference. Based on the
current registered participants, approxiately 30% have chosen to attend the conference virtually. Whether
you join us in person or virtually, we sincerely hope everyone has a remarkable conference experience. 
This General Chair’s message is where I express my gratitude to the many individuals who have made
enormous contributions to the conference over the past year.

Read [**ACL 2023 General Chair's message**](https://docs.google.com/document/d/1WobYM7norbG4dI48s75HfJoD89qgX5a_F-6U8AteLSA/edit?usp=sharing/) in full.

##### **[Conference Handbook](https://2023.aclweb.org/downloads/acl2023-handbook.pdf)**

ACL 2023

The Association for Computational Linguistics (ACL) is the premier international scientific and professional society for people working on computational problems involving human language, a field often referred to as either computational linguistics or natural language processing.

technical paper

ECAI2020 featured a full programme of technical papers, as well as many AI-related events of interest for researchers, students and all attendants who are interested on contemporary AI, including:




**An extensive programme of workshops, tutorials, and invited speakers**

**The Prestigious Applications of Intelligent Systems conference (PAIS)**

**The Frontiers in AI track sessions**

**The Lab To Market event**

**The Women in AI time**

**The EU Challenges forum**

… and many more!

ECAI 2020 featured a full programme of technical papers, as well as many AI-related events of interest for researchers, students and all attendants who are interested on contemporary AI.

Semantics-Reinforced Networks for Question Generation

Keyphrases are multipurpose knowledge gems, rendering keyphrase extraction a very important document processing task. They constitute a concise summary of documents that is extremely useful both for human inspection and machine consumption, in support of a number of tasks in the field of Natural Language Processing, Machine Learning and Information Retrieval. To this regard, the aim of this tutorial is two-fold: (a) to provide an overview of the automatic keyphrase extraction task and (b) to familiarize participants with the keyphrase extraction process. Specifically, we will provide a well‐structured review of the existing work, offer interesting insights on the different evaluation approaches, highlight open issues such as the need for evaluation approaches that take the semantic similarity of predicted and golden keyphrases, present a comparative experimental study of popular techniques, and familiarize the audience with the keyphrase extraction process via a demo presentation using jupyter notebook, which will be available to the audience during the practical part of the tutorial. We expect the tutorial to help newcomers and veterans alike navigate the large amount of prior art and grasp its evolution.

Automatic Keyphrase Extraction from Text: A Walk-through

Many important AI problems involve an optimization component. Maximum satisfiability (MaxSAT) is an optimization version of Boolean satisfiability (SAT) that can be applied to a variety of computationally hard optimization problems that arise in AI. Constituting a declarative approach to optimization, modern state-of-the-art MaxSAT solvers allow for efficiently tackling NP-hard optimization problems arising from different applications via simple propositional encodings. This can be much less time-consuming than building a customized algorithmic solution specific to a particular optimization problem. Indeed, a well-engineered, generic MaxSAT solver can often be more efficient than a custom solution. Furthermore, MaxSAT offers an alternative to the more classical declarative optimization paradigm of integer programming (IP), especially in the many AI applications where the underlying problems are naturally represented with logical constraints. In this tutorial, we will introduce MaxSAT, give an overview of the different techniques that have been developed for solving MaxSAT, focusing on recent advances and covering both complete and incomplete MaxSAT solving, and explain via case studies how MaxSAT has been used to solve problems from different areas of AI. We will also outline major current research directions in MaxSAT. After this tutorial, you should be better equipped to apply modern MaxSAT technology in real-world settings.

Downloads

Next from ECAI 2020

Semantics-Reinforced Networks for Question Generation

Similar lecture

Explanation Regeneration via Information Bottleneck

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from ECAI 2020

Semantics-Reinforced Networks for Question Generation

Similar lecture

Explanation Regeneration via Information Bottleneck

Downloads