English
Related papers

Related papers: Lazy Reimplication in Chronological Backtracking

200 papers

In this paper, we claim that cyclic obfuscation, when properly implemented, poses exponential complexity on SAT or CycSAT attack. The CycSAT, in order to generate the necessary cycle avoidance clauses, uses a pre-processing step. We show…

Cryptography and Security · Computer Science 2018-04-25 Shervin Roshanisefat , Hadi Mardani Kamali , Avesta Sasan

The integration of slow-thinking mechanisms into large language models (LLMs) offers a promising way toward achieving Level 2 AGI Reasoners, as exemplified by systems like OpenAI's o1. However, several significant challenges remain,…

Computation and Language · Computer Science 2025-02-10 Xiao-Wen Yang , Xuan-Yi Zhu , Wen-Da Wei , Ding-Chu Zhang , Jie-Jing Shao , Zhi Zhou , Lan-Zhe Guo , Yu-Feng Li

Continual learning (CL) refers to a machine learning paradigm that learns continuously without forgetting previously acquired knowledge. Thereby, major difficulty in CL is catastrophic forgetting of preceding tasks, caused by shifts in data…

Machine Learning · Computer Science 2023-03-08 Stella Ho , Ming Liu , Lan Du , Longxiang Gao , Yong Xiang

Current RAG retrievers are designed primarily for human readers, emphasizing complete, readable, and coherent paragraphs. However, Large Language Models (LLMs) benefit more from precise, compact, and well-structured input, which enhances…

Computation and Language · Computer Science 2026-01-28 Qianchi Zhang , Hainan Zhang , Liang Pang , Yongxin Tong , Hongwei Zheng , Zhiming Zheng

Reconfiguration aims at recovering a system from a fault by automatically adapting the system configuration, such that the system goal can be reached again. Classical approaches typically use a set of pre-defined faults for which…

Artificial Intelligence · Computer Science 2021-05-19 Kaja Balzereit , Oliver Niggemann

We introduce a lazy approach to the explanation-based approximation of probabilistic logic programs. It uses only the most significant part of the program when searching for explanations. The result is a fast and anytime approximate…

Artificial Intelligence · Computer Science 2015-07-13 Joris Renkens , Angelika Kimmig , Luc De Raedt

Counterfactual explanations enhance interpretability by identifying alternative inputs that produce different outputs, offering localized insights into model decisions. However, traditional methods often neglect causal relationships,…

Machine Learning · Computer Science 2025-05-23 Pouria Fatemi , Ehsan Sharifian , Mohammad Hossein Yassaee

Deep networks allow to obtain outstanding results in semantic segmentation, however they need to be trained in a single shot with a large amount of data. Continual learning settings where new classes are learned in incremental steps and…

Computer Vision and Pattern Recognition · Computer Science 2021-09-21 Andrea Maracani , Umberto Michieli , Marco Toldo , Pietro Zanuttigh

This paper studies causal discovery in irregularly sampled time series-a key challenge in risk-sensitive domains like finance, healthcare, and climate science, where missing data and inconsistent sampling frequencies distort causal…

Machine Learning · Computer Science 2026-05-12 Weihong Li , Baohong Li , Anpeng Wu , Zhihan Li , Ming Ma , Keting Yin , Kun Kuang

While LLMs exhibit impressive fluency and factual recall, they struggle with robust causal reasoning, often relying on spurious correlations and brittle patterns. Similarly, traditional Reinforcement Learning agents also lack causal…

Machine Learning · Computer Science 2025-09-26 Abi Aryan , Zac Liu

Citations from LLM-based RAG systems are supposed to simplify response verification. However, this goal is undermined in cases of citation failure, where a model generates a helpful response, but fails to generate citations to complete…

Computation and Language · Computer Science 2026-04-29 Jan Buchmann , Iryna Gurevych

LLM-based deep research agents are largely built on the ReAct framework. This linear design makes it difficult to revisit earlier states, branch into alternative search directions, or maintain global awareness under long contexts, often…

Temporal logic specifications play an important role in a wide range of software analysis tasks, such as model checking, automated synthesis, program comprehension, and runtime monitoring. Given a set of positive and negative examples,…

Software Engineering · Computer Science 2025-01-03 Changjian Zhang , Parv Kapoor , Ian Dardik , Leyi Cui , Romulo Meira-Goes , David Garlan , Eunsuk Kang

A major drawback of backpropagation through time (BPTT) is the difficulty of learning long-term dependencies, coming from having to propagate credit information backwards through every single step of the forward computation. This makes BPTT…

Artificial Intelligence · Computer Science 2017-11-08 Nan Rosemary Ke , Anirudh Goyal , Olexa Bilaniuk , Jonathan Binas , Laurent Charlin , Chris Pal , Yoshua Bengio

When training neural networks for classification tasks with backpropagation, parameters are updated on every trial, even if the sample is classified correctly. In contrast, humans concentrate their learning effort on errors. Inspired by…

Neural and Evolutionary Computing · Computer Science 2023-03-29 Aaron Pache , Mark CW van Rossum

Continual Learning (CL) is a field dedicated to devise algorithms able to achieve lifelong learning. Overcoming the knowledge disruption of previously acquired concepts, a drawback affecting deep learning models and that goes by the name of…

Computer Vision and Pattern Recognition · Computer Science 2023-01-04 Francesco Pelosin

Chronofold is a replicated data structure for versioned text. It is designed for use in collaborative editors and revision control systems. Past models of this kind either retrofitted local linear orders to a distributed system (the OT…

Data Structures and Algorithms · Computer Science 2020-04-27 Victor Grishchenko , Mikhail Patrakeev

In-context learning (ICL) has transformed the use of large language models (LLMs) for NLP tasks, enabling few-shot learning by conditioning on labeled examples without finetuning. Despite its effectiveness, ICL is prone to errors,…

Computation and Language · Computer Science 2025-03-21 Mario Sanz-Guerrero , Katharina von der Wense

Proof search in non-confluent tableau calculi, such as the connection tableau calculus, suffers from excess backtracking, but simple restrictions on backtracking are incomplete. We adopt constraint learning to reduce backtracking in the…

Logic in Computer Science · Computer Science 2026-03-06 Michael Rawson , Clemens Eisenhofer , Laura Kovács

Constraint-based causal discovery is widely used for learning causal structures, but heavy reliance on conditional independence (CI) testing makes it computationally expensive in high-dimensional settings. To mitigate this limitation, many…

Machine Learning · Computer Science 2026-05-12 Zheng Li , Feng Xie , Shenglan Nie , Xichen Guo , Ruxin Wang , Hao Zhang