English
Related papers

Related papers: Complexity of adaptive testing in scenarios define…

200 papers

Abstract argumentation offers an appealing way of representing and evaluating arguments and counterarguments. This approach can be enhanced by a probability assignment to each argument. There are various interpretations that can be ascribed…

Artificial Intelligence · Computer Science 2014-05-15 Anthony Hunter , Matthias Thimm

We examine the computational complexity of testing and finding small plans in probabilistic planning domains with both flat and propositional representations. The complexity of plan evaluation and existence varies with the plan type sought;…

Artificial Intelligence · Computer Science 2007-05-23 M. L. Littman , J. Goldsmith , M. Mundhenk

We introduce the notion of adaptive synchronisation for pushdown automata, in which there is an external observer who has no knowledge about the current state of the pushdown automaton, but can observe the contents of the stack. The…

Formal Languages and Automata Theory · Computer Science 2021-02-16 A. R. Balasubramanian , K. S. Thejaswini

We study existence of random elements with partially specified distributions. The technique relies on the existence of a positive extension for linear functionals accompanied by additional conditions that ensure the regularity of the…

Probability · Mathematics 2015-01-20 Raphael Lachieze-Rey , Ilya Molchanov

We study the problem of estimating the number of defective items in adaptive Group testing by using a minimum number of queries. We improve the existing algorithm and prove a lower bound that show that, for constant estimation, the number…

Data Structures and Algorithms · Computer Science 2023-12-22 Nader H. Bshouty , Vivian E. Bshouty-Hurani , George Haddad , Thomas Hashem , Fadi Khoury , Omar Sharafy

Experimental design is a fundamental problem in many science and engineering fields. In this problem, sample efficiency is crucial due to the time, money, and safety costs of real-world design evaluations. Existing approaches either rely on…

Machine Learning · Computer Science 2023-11-01 Tung Nguyen , Sudhanshu Agrawal , Aditya Grover

In most real-world settings, due to limited time or other resources, an agent cannot perform all potentially useful deliberation and information gathering actions. This leads to the metareasoning problem of selecting such actions.…

Artificial Intelligence · Computer Science 2007-05-23 Vincent Conitzer , Tuomas Sandholm

In this paper we consider the minimization of a continuous function that is potentially not differentiable or not twice differentiable on the boundary of the feasible region. By exploiting an interior point technique, we present first- and…

Computational Complexity · Computer Science 2017-02-15 Gabriel Haeser , Hongcheng Liu , Yinyu Ye

Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can…

Logic in Computer Science · Computer Science 2007-05-23 Ian Horrocks , Ulrike Sattler , Stephan Tobies

The increasing trend on wireless-connected devices makes opportunistic networking a promising alternative to existing infrastructure-based networks. However, on these networks there is neither guarantee about the availability of the…

Networking and Internet Architecture · Computer Science 2016-06-23 Gwilherm Baudic , Antoine Auger , Victor Ramiro , Emmanuel Lochin

We compare in-context learning with fixed queries and agentic learning with adaptive queries for uniform approximation of task families. We consider two settings: an unrestricted regime, where querying and approximation are arbitrary…

Machine Learning · Computer Science 2026-05-07 Anastasis Kratsios , A. Martina Neuman , Philipp Petersen

Testing whether a variable of interest affects the outcome is one of the most fundamental problem in statistics and is often the main scientific question of interest. To tackle this problem, the conditional randomization test (CRT) is…

Methodology · Statistics 2023-05-26 Dae Woong Ham , Jiaze Qiu

Innovations across science and industry are evaluated using randomized trials (a.k.a. A/B tests). While simple and robust, such static designs are inefficient or infeasible for testing many hypotheses. Adaptive designs can greatly improve…

Machine Learning · Computer Science 2024-08-09 Jimmy Wang , Ethan Che , Daniel R. Jiang , Hongseok Namkoong

We study the problem of learning predictors that are robust to adversarial examples with respect to an unknown perturbation set, relying instead on interaction with an adversarial attacker or access to attack oracles, examining different…

Machine Learning · Computer Science 2021-02-04 Omar Montasser , Steve Hanneke , Nathan Srebro

We analyse the complexity of the satisfiability problem, or similarly feasibility problem, (trSAT) for transformer encoders (TE), which naturally occurs in formal verification or interpretation, collectively referred to as formal reasoning.…

Logic in Computer Science · Computer Science 2025-02-26 Marco Sälzer , Eric Alsmann , Martin Lange

The verification and validation of autonomous driving vehicles remains a major challenge due to the high complexity of autonomous driving functions. Scenario-based testing is a promising method for validating such a complex system.…

Robotics · Computer Science 2023-04-24 Maximilian Zipfl , Nina Koch , J. Marius Zöllner

We study the computational complexity of problems that arise in abstract argumentation in the context of dynamic argumentation, minimal change, and aggregation. In particular, we consider the following problems where always an argumentation…

Data Structures and Algorithms · Computer Science 2014-02-26 Eun Jung Kim , Sebastian Ordyniak , Stefan Szeider

We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the fragment ATL+ of the full Alternating time temporal logic ATL*. The method extends…

Logic in Computer Science · Computer Science 2015-05-28 Serenella Cerrito , Amélie David , Valentin Goranko

In this paper, we introduce a variation of the group testing problem capturing the idea that a positive test requires a combination of multiple ``types'' of item. Specifically, we assume that there are multiple disjoint \emph{semi-defective…

Information Theory · Computer Science 2024-05-10 Thach V. Bui , Jonathan Scarlett

A good process model is expected not only to reflect the behavior of the process, but also to be as easy to read and understand as possible. Because preferences vary across different applications, numerous measures provide ways to reflect…

Formal Languages and Automata Theory · Computer Science 2024-08-23 Patrizia Schalk , Adam Burke , Robert Lorenz