English
Related papers

Related papers: Feasible Plan Generation with Ambiguity-Boundednes…

200 papers

Automated alpha discovery is difficult because the search space of formulaic factors is combinatorial, the signal-to-noise ratio in daily equity data is low, and unconstrained program generation is operationally unsafe. We present Hubble,…

Artificial Intelligence · Computer Science 2026-04-15 Runze Shi , Shengyu Yan , Yuecheng Cai , Chengxi Lv

Model interpretability has become an important problem in machine learning (ML) due to the increased effect that algorithmic decisions have on humans. Counterfactual explanations can help users understand not only why ML models make certain…

Machine Learning · Computer Science 2021-12-20 Ana Lucic , Harrie Oosterhuis , Hinda Haned , Maarten de Rijke

Eliciting information to reduce uncertainty about a latent entity is a critical task in many application domains, e.g., assessing individual student learning outcomes, diagnosing underlying diseases, or learning user preferences. Though…

Computation and Language · Computer Science 2025-07-10 Jimmy Wang , Thomas Zollo , Richard Zemel , Hongseok Namkoong

In the Multi-Agent Path Finding (MAPF) problem, the goal is to find non-colliding paths for agents in an environment, such that each agent reaches its goal from its initial location. In safety-critical applications, a human supervisor may…

Artificial Intelligence · Computer Science 2023-03-15 Justin Kottinger , Shaull Almagor , Morteza Lahijanian

Natural language processing (NLP) aims at investigating the interactions between agents and humans, processing and analyzing large amounts of natural language data. Large-scale language models play an important role in current natural…

Artificial Intelligence · Computer Science 2023-04-14 Kebing Jin , Hankz Hankui Zhuo

Formal languages are essential for computer programming and are constructed to be easily processed by computers. In contrast, natural languages are much more challenging and instigated the field of Natural Language Processing (NLP). One…

Computation and Language · Computer Science 2024-08-15 Daphne Wang

Answering science questions posed in natural language is an important AI challenge. Answering such questions often requires non-trivial inference and knowledge that goes beyond factoid retrieval. Yet, most systems for this task are based on…

Artificial Intelligence · Computer Science 2016-04-21 Daniel Khashabi , Tushar Khot , Ashish Sabharwal , Peter Clark , Oren Etzioni , Dan Roth

Inductive Logic Programming (ILP) combines rule-based and statistical artificial intelligence methods, by learning a hypothesis comprising a set of rules given background knowledge and constraints for the search space. We focus on extending…

Artificial Intelligence · Computer Science 2018-02-01 Mishal Kazmi , Peter Schüller , Yücel Saygın

Being able to efficiently retrieve the required building information is critical for construction project stakeholders to carry out their engineering and management activities. Natural language interface (NLI) systems are emerging as a time…

Computation and Language · Computer Science 2023-03-28 Mengtian Yin , Llewellyn Tang , Chris Webster , Shen Xu , Xiongyi Li , Huaquan Ying

Enabling robotic agents to perform complex long-horizon tasks has been a long-standing goal in robotics and artificial intelligence (AI). Despite the potential shown by large language models (LLMs), their planning capabilities remain…

Robotics · Computer Science 2024-07-16 Guanqi Chen , Lei Yang , Ruixing Jia , Zhe Hu , Yizhou Chen , Wei Zhang , Wenping Wang , Jia Pan

Non-deterministic planning aims to find a policy that achieves a given objective in an environment where actions have uncertain effects, and the agent - potentially - only observes parts of the current state. Hyperproperties are properties…

Logic in Computer Science · Computer Science 2024-05-24 Raven Beutner , Bernd Finkbeiner

We consider algorithms and lower bounds for various problems over forest languages; as input models we allow forest algebras, deterministic forest automata and nondeterministic forest automata. For the equivalence problem, we give an…

Formal Languages and Automata Theory · Computer Science 2021-06-07 Marcial Gaißert , Manfred Kufleitner

We investigate the computational complexity of mining guarded clauses from clausal datasets through the framework of inductive logic programming (ILP). We show that learning guarded clauses is NP-complete and thus one step below the…

Computational Complexity · Computer Science 2021-10-08 Andrei Draghici , Georg Gottlob , Matthias Lanzinger

Information Retrieval (IR) is an important application area of Natural Language Processing (NLP) where one encounters the genuine challenge of processing large quantities of unrestricted natural language text. While much effort has been…

cmp-lg · Computer Science 2008-02-03 Chengxiang Zhai

In the rapidly evolving field of Explainable Natural Language Processing (NLP), textual explanations, i.e., human-like rationales, are pivotal for explaining model predictions and enriching datasets with interpretable labels. Traditional…

Computation and Language · Computer Science 2025-11-12 Mahdi Dhaini , Juraj Vladika , Ege Erdogan , Zineb Attaoui , Gjergji Kasneci

State-of-the-art deep-learning-based approaches to Natural Language Processing (NLP) are credited with various capabilities that involve reasoning with natural language texts. In this paper we carry out a large-scale empirical study…

Computation and Language · Computer Science 2022-11-11 Viktor Schlegel , Kamen V. Pavlov , Ian Pratt-Hartmann

Neural networks are widely regarded as black-box models, creating significant challenges in understanding their inner workings, especially in natural language processing (NLP) applications. To address this opacity, model explanation…

Computation and Language · Computer Science 2025-01-10 Melkamu Mersha , Mingiziem Bitewa , Tsion Abay , Jugal Kalita

While Large Language Models (LLMs) provide semantic flexibility for robotic task planning, their susceptibility to hallucination and logical inconsistency limits their reliability in long-horizon domains. To bridge the gap between…

Artificial Intelligence · Computer Science 2026-03-26 Keru Hua , Ding Wang , Yaoying Gu , Xiaoguang Ma

Large language models (LLMs) effectively generate fluent text when the target output follows natural language patterns. However, structured prediction tasks confine the output format to a limited ontology, causing even very large models to…

Computation and Language · Computer Science 2023-10-19 Derek Chen , Celine Lee , Yunan Lu , Domenic Rosati , Zhou Yu

In recent years, numerous vision and learning tasks have been (re)formulated as nonconvex and nonsmooth programmings(NNPs). Although some algorithms have been proposed for particular problems, designing fast and flexible optimization…

Computer Vision and Pattern Recognition · Computer Science 2017-07-03 Yiyang Wang , Risheng Liu , Xiaoliang Song , Zhixun Su
‹ Prev 1 4 5 6 7 8 10 Next ›