English
Related papers

Related papers: Specifying Robustness

200 papers

Counterfactual Explanations (CEs) have received increasing interest as a major methodology for explaining neural network classifiers. Usually, CEs for an input-output pair are defined as data points with minimum distance to the input that…

Machine Learning · Computer Science 2024-04-05 Junqi Jiang , Jianglin Lan , Francesco Leofante , Antonio Rago , Francesca Toni

Large Language Models (LLMs) are increasingly used to generate natural-language explanations in recommender systems, acting as explanation agents that reason over user behavior histories. While prior work has focused on explanation fluency…

Information Retrieval · Computer Science 2026-02-04 Guilin Zhang , Kai Zhao , Jeffrey Friedman , Xu Chu

We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e.,…

Logic in Computer Science · Computer Science 2019-01-23 Mikhail Rybakov , Dmitry Shkatov

There is a growing interest in techniques for detecting whether a logic specification is satisfied too easily, or vacuously. For example, the specification "every request is eventually followed by an acknowledgment" is satisfied vacuously…

Logic in Computer Science · Computer Science 2010-10-14 Arie Gurfinkel , Marsha Chechik

Robust explanations of machine learning models are critical to establish human trust in the models. Due to limited cognition capability, most humans can only interpret the top few salient features. It is critical to make top salient…

Machine Learning · Computer Science 2023-07-11 Chao Chen , Chenghua Guo , Guixiang Ma , Ming Zeng , Xi Zhang , Sihong Xie

We present a framework to synthesize control policies for nonlinear dynamical systems from complex temporal constraints specified in a rich temporal logic called Signal Temporal Logic (STL). We propose a novel smooth and differentiable STL…

Systems and Control · Computer Science 2019-04-29 Iman Haghighi , Noushin Mehdipour , Ezio Bartocci , Calin Belta

HyperLTL, the extension of Linear Temporal Logic by trace quantifiers, is a uniform framework for expressing information flow policies by relating multiple traces of a security-critical system. HyperLTL has been successfully applied to…

Logic in Computer Science · Computer Science 2019-12-17 Corto Mascle , Martin Zimmermann

State-of-the-art NLP models can often be fooled by human-unaware transformations such as synonymous word substitution. For security reasons, it is of critical importance to develop models with certified robustness that can provably…

Machine Learning · Computer Science 2020-06-01 Mao Ye , Chengyue Gong , Qiang Liu

Based on existing ideas in the field of imprecise probabilities, we present a new approach for assessing the reliability of the individual predictions of a generative probabilistic classifier. We call this approach robustness…

Machine Learning · Computer Science 2025-04-11 Adrián Detavernier , Jasper De Bock

The wide availability of data coupled with the computational advances in artificial intelligence and machine learning promise to enable many future technologies such as autonomous driving. While there has been a variety of successful…

Systems and Control · Electrical Eng. & Systems 2022-10-11 Lars Lindemann , Lejun Jiang , Nikolai Matni , George J. Pappas

The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and…

Logic in Computer Science · Computer Science 2018-08-16 Laura Bozzelli , Aniello Murano , Adriano Peron

We study succinctness as a measure of the expressive power of transformers. Succinctness -- how compactly a formalism can describe a language relative to other formalisms -- is a classical notion in logic and automata theory. We prove that…

Formal Languages and Automata Theory · Computer Science 2026-05-18 Pascal Bergsträßer , Ryan Cotterell , Anthony W. Lin

We present a new, scalable alternative to the structured singular value, which we call $\nu$, provide a convex upper bound, study their properties and compare them to $\ell_1$ robust control. The analysis relies on a novel result on the…

Optimization and Control · Mathematics 2022-04-13 Olle Kjellqvist , John C. Doyle

We consider a path-planning scenario for a mobile robot traveling in a configuration space with obstacles under the presence of stochastic disturbances. A novel path length metric is proposed on the uncertain configuration space and then…

Robotics · Computer Science 2020-03-02 Jeb Stefan , Ali Reza Pedram , Riku Funada , Takashi Tanaka

We study a challenging form of Smoothed Online Convex Optimization, a.k.a. SOCO, including multi-step nonlinear switching costs and feedback delay. We propose a novel machine learning (ML) augmented online algorithm, Robustness-Constrained…

Machine Learning · Computer Science 2023-11-01 Pengfei Li , Jianyi Yang , Adam Wierman , Shaolei Ren

A continual learning (CL) algorithm learns from a non-stationary data stream. The non-stationarity is modeled by some schedule that determines how data is presented over time. Most current methods make strong assumptions on the schedule and…

Machine Learning · Computer Science 2022-10-17 Ruohan Wang , Marco Ciccone , Giulia Luise , Andrew Yapp , Massimiliano Pontil , Carlo Ciliberto

Robustness verification that aims to formally certify the prediction behavior of neural networks has become an important tool for understanding model behavior and obtaining safety guarantees. However, previous methods can usually only…

Machine Learning · Computer Science 2020-12-24 Zhouxing Shi , Huan Zhang , Kai-Wei Chang , Minlie Huang , Cho-Jui Hsieh

Neural networks achieve outstanding accuracy in classification and regression tasks. However, understanding their behavior still remains an open challenge that requires questions to be addressed on the robustness, explainability and…

Machine Learning · Computer Science 2021-05-13 Anna-Kathrin Kopetzki , Stephan Günnemann

Traditional ETL and ELT design patterns struggle to meet modern requirements of scalability, governance, and real-time data processing. Hybrid approaches such as ETLT (Extract-Transform-Load-Transform) and ELTL (Extract-Load-Transform-Load)…

Databases · Computer Science 2025-11-06 Chiara Rucco , Motaz Saad , Antonella Longo

With the increasing scale of communication networks, the likelihood of failures grows as well. Since these networks form a critical backbone of our digital society, it is important that they rely on robust routing algorithms which ensure…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-12-01 Christoph Lenzen , Moti Medina , Mehrdad Saberi , Stefan Schmid
‹ Prev 1 4 5 6 7 8 10 Next ›