Expected loss bounds for authentication in constrained channels

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Many feedforward neural networks (NNs) generate continuous and piecewise-linear (CPWL) mappings. Specifically, they partition the input domain into regions on which the mapping is affine. The number of these so-called linear regions offers a natural metric ...

This paper rethinks Sharpness-Aware Minimization (SAM), which is originally formulated as a zero-sum game where the weights of a network and a bounded perturbation try to minimize/maximize, respectively, the same differentiable loss. We argue that SAM shou ...

This paper proposes an algorithm to upper-bound maximal quantile statistics of a state function over the course of a Stochastic Differential Equation (SDE) system execution. This chance-peak problem is posed as a nonconvex program aiming to maximize the Va ...

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

We develop a methodology to measure the expected loss of commercial banks in a market downturn, which we call stressed expected loss (SEL). We simulate a market downturn as a negative shock on interest rate and credit market risk factors that reflect the b ...

We consider finite-level, symmetric quantization procedures for construction and decoding of polar codes. Whether polarization occurs in the presence of quantization is not known in general. In [1], it is shown that a simple three-level quantization proced ...

Random codes based on quasigroups (RCBQ) are cryptcodes, i.e. they are error-correcting codes, which provide information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms for these codes are defined elsewhere. Also, the performance of these codes f ...

Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F subset of 2([n]) that does not contain an induced copy of P. It was proved by Methuku and Palvolgyi that there exists a constant C-P (depending only on P) su ...

Polar codes are a recent family of error-correcting codes with a number of desirable characteristics. Their disruptive nature is illustrated by their rapid adoption in the 5 th-generation mobile-communication standard, where they are used to protect contro ...

We consider an optimal control problem (OCP) for a partial differential equation (PDE) with random coefficients. The optimal control function is a deterministic, distributed forcing term that minimizes an expected quadratic regularized loss functional. For ...

This thesis develops a unified framework for modeling and solving various classes of rich routing problems with stochastic demands, including the VRP and the IRP. The work is inspired by the problem of collecting recyclables from sensorized containers in G ...

In the context of static real-time optimization (RTO) of uncertain plants, the standard modifier-adaptation scheme consists in adding first-order correction terms to the cost and constraint functions of a model based optimization problem. If the algorithm ...

Polar codes are a recently proposed family of provably capacity-achieving error-correction codes that received a lot of attention. While their theoretical properties render them interesting, their practicality compared to other types of codes has not been ...

The prototypical signal processing pipeline can be divided into four blocks. Representation of the signal in a basis suitable for processing. Enhancement of the meaningful part of the signal and noise reduction. Estimation of important statistical properti ...

Scratchpad memory (SPM) is widely used in modern embedded processors to overcome the limitations of cache memory. The high vulnerability of SPM to soft errors, however, limits its usage in safety-critical applications. This paper proposes an efficient faul ...

State-of-the-art wearable devices such as embedded biomedical monitoring systems apply voltage scaling to lower as much as possible their energy consumption and achieve longer battery lifetimes. While embedded memories often rely on Error Correction Codes ...

We consider multitype branching processes evolving in a Markovian random environment. To determine whether or not the branching process becomes extinct almost surely is akin to computing the maximal Lyapunov exponent of a sequence of random matrices, which ...

Approximation circuits offer superior performance (speed and area) compared to traditional circuits at the cost of computational accuracy. The accuracy of the results in approximation circuits is evaluated based on several error metrics such as worst-case ...

We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a number of authentication protocols, where at least some part of the authentication ...

We study the nonlinear stochastic heat equation in the spatial domain R, driven by space-time white noise. A central special case is the parabolic Anderson model. The initial condition is taken to be a measure on R, such as the Dirac delta function, but th ...

Expected loss bounds for authentication in constrained channels

Chattez avec Graph Search

On the number of regions of piecewise linear neural networks

Improving SAM Requires Rethinking its Optimization Formulation

Peak Value-at-Risk Estimation for Stochastic Differential Equations using Occupation Measures

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Predicting the stressed expected loss of large US banks

Finite-Level Quantization Procedures for Construction and Decoding of Polar Codes

Gaussian channel transmission of images and audio files using cryptcoding

Forbidden induced subposets of given height

On the Tradeoff Between Accuracy and Complexity in Blind Detection of Polar Codes

PDE-Constrained Optimal Control Problems with Uncertain Parameters using SAGA

Rich Vehicle and Inventory Routing Problems with Stochastic Demands

A feasible-side globally convergent modifier-adaptation scheme

Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders

Rake, Peel, Sketch : The Signal Processing Pipeline Revisited

A Cache-Assisted Scratchpad Memory for Multiple-Bit-Error Correction

Energy vs. Reliability Trade-offs Exploration in Biomedical Ultra-Low Power Devices

Lyapunov Exponents for Branching Processes in a Random Environment: The Effect of Information

Approximation-aware Rewriting of AIGs for Error Tolerant Applications

Expected Loss Analysis for Authentication in Constrained Channels

Moments And Growth Indices For The Nonlinear Stochastic Heat Equation With Rough Initial Conditions