Related papers: Function-Correcting Codes for Locally Bounded Func…
We propose two families of asymptotically local minimax lower bounds on parameter estimation performance. The first family of bounds applies to any convex, symmetric loss function that depends solely on the difference between the estimate…
Function-correcting codes with data protection simultaneously protect both the data and a function of the data at distinct error-correction levels. When the function receives strictly stronger protection than the data, such a code is called…
This paper studies stochastic optimization for a sum of compositional functions, where the inner-level function of each summand is coupled with the corresponding summation index. We refer to this family of problems as finite-sum coupled…
We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube ${0,1}^n$. Informally, a function $f:{0,1}^n \rightarrow \mathbb{R}$ is self-bounding if for every $x…
When a node in a distributed storage system fails, it needs to be promptly repaired to maintain system integrity. While typical erasure codes can provide a significant storage advantage over replication, they suffer from poor repair…
We present a precise characterization of linear functional-repair storage codes in terms of {\em admissible states/}, with each state made up from a collection of vector spaces over some fixed finite field. To illustrate the usefulness of…
Affine-invariant codes are codes whose coordinates form a vector space over a finite field and which are invariant under affine transformations of the coordinate space. They form a natural, well-studied class of codes; they include popular…
We investigate the relation between the girth and the guaranteed error correction capability of $\gamma$-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms. A lower bound on the number of variable…
We provide novel theoretical results regarding local optima of regularized $M$-estimators, allowing for nonconvexity in both loss and penalty functions. Under restricted strong convexity on the loss and suitable regularity conditions on the…
Based on the theoretical neuroscience, G. Cotardo and A. Ravagnavi in \cite{CR} introduced a kind of asymmetric binary codes called combinatorial neural codes (CN codes for short), with a "matched metric" $\delta_{r}$ called asymmetric…
The locally repairable codes (LRCs) were introduced to correct erasures efficiently in distributed storage systems. LRCs are extensively studied recently. In this paper, we first deal with the open case remained in \cite{q} and derive an…
Recent efforts in coding theory have focused on building codes for insertions and deletions, called insdel codes, with optimal trade-offs between their redundancy and their error-correction capabilities, as well as efficient encoding and…
By incorporating the concept of locality into quantum information theory, quantum locally recoverable codes (qLRCs) have been proposed, motivated by their potential applications in large-scale quantum data storage and their relevance to…
We present a metric-space approach to quantify the performance of density-functional approximations for interacting many-body systems and to explore the validity of the Hohenberg-Kohn-type theorem on fermionic lattices. This theorem…
We report two analytical bounds for quantum error-correcting codes that do not have preexisting classical counterparts. Firstly the quantum Hamming and Singleton bounds are combined into a single tighter bound, and then the combined bound…
In this paper, we define and analyze a subclass of (time-invariant) Control Barrier Functions (CBF) that have favorable properties for the construction of uniformly timevarying CBFs and thereby for the satisfaction of uniformly time-varying…
We propose localized functional principal component analysis (LFPCA), looking for orthogonal basis functions with localized support regions that explain most of the variability of a random process. The LFPCA is formulated as a convex…
Recent years, several new types of codes were introduced to provide fault-tolerance and guarantee system reliability in distributed storage systems, among which locally repairable codes (LRCs for short) have played an important role. A…
We develop a new technique for studying the boundary limiting behavior of a holomorphic function on a domain $\Omega$ -- both in one and several complex variables. The approach involves two new localized maximal functions. As a result of…
This paper investigates the statistical properties of random open dynamical systems generated by families of Lasota--Yorke maps. Open systems, in which trajectories may escape through `holes', model transient phenomena and present…