English
Related papers

Related papers: Multi-user guesswork and brute force security

200 papers

Motivated by modern applications such as computerized adaptive testing, sequential rank aggregation, and heterogeneous data source selection, we study the problem of active sequential estimation, which involves adaptively selecting…

Statistics Theory · Mathematics 2024-02-14 Xiaoou Li , Hongru Zhao

Methods to certify the robustness of neural networks in the presence of input uncertainty are vital in safety-critical settings. Most certification methods in the literature are designed for adversarial input uncertainty, but researchers…

Machine Learning · Computer Science 2023-01-26 Brendon G. Anderson , Somayeh Sojoudi

Many software analysis techniques attempt to determine whether bugs are reachable, but for security purpose this is only part of the story as it does not indicate whether the bugs found could be easily triggered by an attacker. The recently…

Programming Languages · Computer Science 2022-12-13 Sébastien Bardin , Guillaume Girol

In this paper, we consider the satisfiability problem for string logic with equations, regular membership and Presburger constraints over length functions. The difficulty comes from multiple occurrences of string variables making…

Logic in Computer Science · Computer Science 2016-10-12 Quang Loc Le

This paper describes a novel approach to planning which takes advantage of decision theory to greatly improve robustness in an uncertain environment. We present an algorithm which computes conditional plans of maximum expected utility. This…

Artificial Intelligence · Computer Science 2013-02-28 Stephen G. Pimentel , Lawrence M. Brem

Learning useful representations from unstructured data is one of the core challenges, as well as a driving force, of modern data-driven approaches. Deep learning has demonstrated the broad advantages of learning and harnessing such…

Cryptography and Security · Computer Science 2020-07-28 Dario Pasquini , Ankit Gangwal , Giuseppe Ateniese , Massimo Bernaschi , Mauro Conti

Software security is of utmost importance for most software systems. Developers must systematically select, plan, design, implement, and especially, maintain and evolve security features -- functionalities to mitigate attacks or protect…

Software Engineering · Computer Science 2025-09-30 Kevin Hermann , Sven Peldszus , Jan-Philipp Steghöfer , Thorsten Berger

Rust, an emerging programming language with explosive growth, provides a robust type system that enables programmers to write memory-safe and data-race free code. To allow access to a machine's hardware and to support low-level performance…

Software Engineering · Computer Science 2020-07-03 Ana Nora Evans , Bradford Campbell , Mary Lou Soffa

String matching is one of the most fundamental problems in computer science. A natural problem is to determine the number of characters that need to be queried (i.e. the decision tree complexity) in a string in order to decide whether this…

Computational Complexity · Computer Science 2018-06-29 Xiaoyu He , Neng Huang , Xiaoming Sun

The fundamental limits of biometric identification systems under a strong secrecy criterion are investigated. In the previous studies of this scenario, the fundamental trade-off among secrecy, template, privacy- and secrecy-leakages has…

Information Theory · Computer Science 2021-02-03 Vamoua Yachongka , Hideki Yagi

The problem of sequentially maximizing the expectation of a function seeks to maximize the expected value of a function of interest without having direct control on its features. Instead, the distribution of such features depends on a given…

Machine Learning · Statistics 2022-10-26 Diego Martinez-Taboada , Dino Sejdinovic

We study contextual stochastic optimization problems, where we leverage rich auxiliary observations (e.g., product characteristics) to improve decision making with uncertain variables (e.g., demand). We show how to train forest decision…

Optimization and Control · Mathematics 2022-03-17 Nathan Kallus , Xiaojie Mao

Maximal repetition of a string is the maximal length of a repeated substring. This paper investigates maximal repetition of strings drawn from stochastic processes. Strengthening previous results, two new bounds for the almost sure growth…

Information Theory · Computer Science 2020-03-11 Łukasz Dębowski

One popular group of defense techniques against adversarial attacks is based on injecting stochastic noise into the network. The main source of robustness of such stochastic defenses however is often due to the obfuscation of the gradients,…

Computer Vision and Pattern Recognition · Computer Science 2022-06-06 Nikola Popovic , Danda Pani Paudel , Thomas Probst , Luc Van Gool

Background. In recent years, cyber security security user studies have been appraised in meta-research, mostly focusing on the completeness of their statistical inferences and the fidelity of their statistical reporting. However, estimates…

Human-Computer Interaction · Computer Science 2020-10-06 Thomas Groß

When people pursue rewards in stochastic environments, they often match their choice frequencies to the observed target frequencies, even when this policy is demonstrably sub-optimal. We used a ``hide and seek'' task to evaluate this…

Neurons and Cognition · Quantitative Biology 2025-11-11 Peter DiBerardino , Britt Anderson

The guesswork quantifies the minimum cost incurred in guessing the state of an ensemble, when only one state can be queried at a time. In the classical case, it is well known that the optimal strategy trivially consists of querying the…

Quantum Physics · Physics 2024-03-22 Michele Dall'Arno

A core element in decision-making under uncertainty is the feedback on the quality of the performed actions. However, in many applications, such feedback is restricted. For example, in recommendation systems, repeatedly asking the user to…

Machine Learning · Computer Science 2021-07-13 Yonathan Efroni , Nadav Merlis , Aadirupa Saha , Shie Mannor

Consider a decision maker who is responsible to dynamically collect observations so as to enhance his information about an underlying phenomena of interest in a speedy manner while accounting for the penalty of wrong declaration. Due to the…

Information Theory · Computer Science 2013-12-19 Mohammad Naghshvar , Tara Javidi

In budget-feasible mechanism design, a buyer wishes to procure a set of items of maximum value from self-interested players. We have a valuation function $v:2^U \to \mathbb{R}_+$, where $U$ is the set of all items, where $v(S)$ specifies…

Computer Science and Game Theory · Computer Science 2026-03-25 Rian Neogi , Kanstantsin Pashkovich , Chaitanya Swamy
‹ Prev 1 8 9 10 Next ›