Search
Search Results
-
Exploring the impact of post-training rounding in regression models
Post-training rounding, also known as quantization, of estimated parameters stands as a widely adopted technique for mitigating energy consumption...
-
Investigating the impact of calibration on the quality of explanations
Predictive models used in Decision Support Systems (DSS) are often requested to explain the reasoning to users. Explanations of instances consist of...
-
Extractors for Small Zero-Fixing Sources
Let V ⊆ [ n ] be a k -element subset of [ n ]. The uniform distribution on the 2 k strings from {0, 1} n that are set to zero outside of V is called an ( n, k ...
-
Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
We study the decomposition of multivariate polynomials as sums of powers of linear forms. We give a randomised algorithm for the following problem:...
-
A probabilistic extension to Conway’s Game of Life
The “Game of life” model was created in 1970 by the mathematician John Horton Conway using cellular automata. Since then, different extensions of...
-
Tournament Quasirandomness from Local Counting
A well-known theorem of Chung and Graham states that if h ≥ 4 then a tournament T is quasirandom if and only if T contains each h -vertex tournament...
-
On Hitting-Set Generators for Polynomials that Vanish Rarely
The problem of constructing pseudorandom generators for polynomials of low degree is fundamental in complexity theory and has numerous well-known...
-
Upper and Lower Bounds for the Synchronizer Performance in Systems with Probabilistic Message Loss
In this paper, we revisit the performance of the α -synchronizer in distributed systems with probabilistic message loss as introduced in Függer et al....
-
Stochastic Analysis of Minimal Automata Growth for Generalized Strings
Generalized strings describe various biological motifs that arise in molecular and computational biology. In this manuscript, we introduce an...
-
On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs
We study property testing of (di)graph properties in bounded-degree graph models. The study of graph properties in bounded-degree models is one of...
-
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials
This work studies the question of quantified derandomization , which was introduced by Goldreich and Wigderson (STOC 2014). The generic quantified...
-
On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace
We show that approximating the second eigenvalue of stochastic operators is
BPL -complete, thus giving a natural problem complete for this class. We... -
A novel robust principal component analysis method for image and video processing
The research on the robust principal component analysis has been attracting much attention recently. Generally, the model assumes sparse noise and...
-
Sparse affine-invariant linear codes are locally testable
We show that sparse affine-invariant linear properties over arbitrary finite fields are locally testable with a constant number of queries. Given a...
-
Constraints, MMSNP and expander relational structures
We give a poly-time construction for a combinatorial classic known as Sparse Incomparability Lemma, studied by Erdős, Lovász, Nešetřil, Rödl and...
-
DNF sparsification and a faster deterministic counting algorithm
Given a
DNF formula f on n variables, the two natural size measures are the number of terms or size s ( f ) and the maximum width of a term w ( f ). It is... -
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields
In this paper, we give the first construction of a pseudorandom generator, with seed length O (log n ), for CC 0 [ p ], the class of constant-depth...
-
Discovering the suitability of optimisation algorithms by learning from evolved instances
The suitability of an optimisation algorithm selected from within an algorithm portfolio depends upon the features of the particular instance to be...