中文
相关论文

相关论文: Indistinguishability Obfuscation from Well-Founded…

200 篇论文

In this expository note we show that the learning parities with noise (LPN) assumption is robust to weak dependencies in the noise distribution of small batches of samples. This provides a partial converse to the linearization technique of…

密码学与安全 · 计算机科学 2024-04-18 Noah Golowich , Ankur Moitra , Dhruv Rohatgi

Motivated by parametric models for which the likelihood is analytically unavailable, numerically unstable, or prohibitively expensive to compute or optimize, we develop a prior- and likelihood-free framework for fully probabilistic…

统计方法学 · 统计学 2026-03-17 Leonardo Cella , Emily C. Hector

We revisit a subexponential bound for the $abc$ conjecture due to the first author, and we establish a variation of it using linear forms in logarithms. As an application, we prove an unconditional subexponential bound towards the $4$-terms…

数论 · 数学 2024-06-10 Hector Pasten , Rocío Sepúlveda-Manzo

We prove a new uncertainty principle for square-integrable irreducible unitary representations of connected Lie groups. The concentration of the matrix coefficients is measured in terms of weighted $L^p$ norms, with weights in the local…

经典分析与常微分方程 · 数学 2024-03-05 Fabio Nicola

The Discrete Gaussian Chain is a model of interfaces $\Psi : \mathbf{Z} \to \mathbf{Z}$ governed by the Hamiltonian $$ H(\Psi)= \sum_{i\neq j} J_\alpha(|i-j|) |\Psi_i -\Psi_j|^2 $$ with long-range coupling constants $J_\alpha(k)\asymp…

概率论 · 数学 2024-05-20 Christophe Garban

We show that some hard to detect properties of quadratic ODEs (eg certain preserved integrals and measures) can be deduced more or less algorithmically from their Kahan discretization, using Darboux Polynomials (DPs). Somewhat similar…

经典分析与常微分方程 · 数学 2021-04-14 G. R. W. Quispel , D. I. McLaren , C. Evripidou

For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs. When the DDP has minimum left degree at…

信息论 · 计算机科学 2016-11-17 Arunkumar Subramanian , Andrew Thangaraj , Matthieu Bloch , Steven W. McLaughlin

A stochastic PDE, describing mesoscopic fluctuations in systems of weakly interacting inertial particles of finite volume, is proposed and analysed in any finite dimension $d\in\mathbb{N}$. It is a regularised and inertial version of the…

偏微分方程分析 · 数学 2021-02-10 Federico Cornalba , Tony Shardlow , Johannes Zimmer

Using new results on the separability properties of bosonic systems, we provide a new complete criterion for separability. This criterion aims at characterizing the set of separable states from the inside by means of a sequence of…

量子物理 · 物理学 2013-05-29 Miguel Navascues , Masaki Owari , Martin B. Plenio

Two major considerations when encoding pseudo-Boolean (PB) constraints into SAT are the size of the encoding and its propagation strength, that is, the guarantee that it has a good behaviour under unit propagation. Several encodings with…

人工智能 · 计算机科学 2021-01-07 Alexis de Colnet

Fra\"iss\'e's conjecture (proved by Laver) is implied by the $\Pi^1_1$-comprehension axiom of reverse mathematics, as shown by Montalb\'an. The implication must be strict for reasons of quantifier complexity, but it seems that no better…

逻辑 · 数学 2024-06-21 Anton Freund

In this paper we consider the conservative Lasso which we argue penalizes more correctly than the Lasso and show how it may be desparsified in the sense of van de Geer et al. (2014) in order to construct asymptotically honest (uniform)…

统计理论 · 数学 2017-11-15 Mehmet Caner , Anders Bredahl Kock

We introduce a new class of pseudoprimes-so called "overpseudoprimes" which is a special subclass of super-Poulet pseudoprimes. Denoting via h(n) the multiplicative order of 2 modulo n, we show that odd number n is overpseudoprime iff value…

数论 · 数学 2012-03-19 Vladimir Shevelev

Opaque predicates are a well-established fundamental building block for software obfuscation. Simplified, an opaque predicate implements an expression that provides constant Boolean output, but appears to have dynamic behavior for static…

密码学与安全 · 计算机科学 2019-10-03 Max Hoffmann , Christof Paar

The \emph{International Obfuscated C Code Contest} was a programming contest for the most creatively obfuscated yet succinct C code. By \emph{contrast}, an interest herein is in programs which are, \emph{in a sense}, \emph{easily} seen to…

逻辑 · 数学 2019-03-14 John Case , Michael Ralston

We prove the support recovery for a general class of linear and nonlinear evolutionary partial differential equation (PDE) identification from a single noisy trajectory using $\ell_1$ regularized Pseudo-Least Squares model~($\ell_1$-PsLS).…

数值分析 · 数学 2021-03-15 Yuchen He , Namjoon Suh , Xiaoming Huo , Sungha Kang , Yajun Mei

We consider the problem of learning a discrete distribution in the presence of an $\epsilon$ fraction of malicious data sources. Specifically, we consider the setting where there is some underlying distribution, $p$, and each data source…

机器学习 · 计算机科学 2017-11-23 Mingda Qiao , Gregory Valiant

We establish spectral enclosures and spectral approximation results for the inhomogeneous lossy Drude-Lorentz system with purely imaginary poles, in a possibly unbounded Lipschitz domain of $\mathbb{R}^3$. Under the assumption that the…

谱理论 · 数学 2022-12-02 Francesco Ferraresso , Marco Marletta

Protection against disclosure is a legal and ethical obligation for agencies releasing microdata files for public use. Consider a microdata sample of size $n$ from a finite population of size $\bar{n}=n+\lambda n$, with $\lambda>0$, such…

统计理论 · 数学 2019-02-15 Federico Camerlenghi , Stefano Favaro , Zacharie Naulet , Francesca Panero

Let L be a restricted Lie algebra over a field of characteristic p > 2 and denote by u(L) its restricted enveloping algebra. We determine the conditions under which the set of symmetric elements of u(L) with respect to the principal…

环与代数 · 数学 2015-11-02 S. Siciliano , H. Usefi