相关论文: A backtracking survey propagation algorithm for K-…

Using elementary rigorous methods we prove the existence of a clustered phase in the random $K$-SAT problem, for $K\geq 8$. In this phase the solutions are grouped into clusters which are far away from each other. The results are in…

Dataset distillation extracts a small set of synthetic training samples from a large dataset with the goal of achieving competitive performance on test data when trained on this sample. In this work, we tackle dataset distillation at its…

Schoening in 1999 presented a simple randomized algorithm for k-SAT with running time O(a^n * poly(n)) for a = 2(k-1)/k. We give a deterministic version of this algorithm running in time O((a+epsilon)^n * poly(n)), where epsilon > 0 can be…

We introduce backdrop, a flexible and simple-to-implement method, intuitively described as dropout acting only along the backpropagation pipeline. Backdrop is implemented via one or more masking layers which are inserted at specific points…

In this note I will review some of the recent results that have been obtained in the probabilistic approach to the random satisfiability problem. At the present moment the results are only heuristic. In the case of the random…

We propose a sampling scheme that can perfectly reconstruct a collection of spikes on the sphere from samples of their lowpass-filtered observations. Central to our algorithm is a generalization of the annihilating filter method, a tool…

Data processing has to deal with many practical difficulties. Data is often corrupted by artifacts or noise and acquiring data can be expensive and difficult. Thus, the given data is often incomplete and inaccurate. To overcome these…

We propose a simple yet effective technique for neural network learning. The forward propagation is computed as usual. In back propagation, only a small subset of the full gradient is computed to update the model parameters. The gradient…

Many imaging technologies rely on tomographic reconstruction, which requires solving a multidimensional inverse problem given a finite number of projections. Backprojection is a popular class of algorithm for tomographic reconstruction,…

Phase transition is an important feature of SAT problem. For random k-SAT model, it is proved that as r (ratio of clauses to variables) increases, the structure of solutions will undergo a sudden change like satisfiability phase transition…

Variations of target appearance such as deformations, illumination variance, occlusion, etc., are the major challenges of visual object tracking that negatively impact the performance of a tracker. An effective method to tackle these…

It has recently been suggested that evolution exploits a form of fitness landscape smoothing within eukaryotic sex due to the haploid-diploid cycle. This short paper presents a simple modification to the standard evolutionary computing…

We describe a sounding technique that allows us to improve spatial resolution of Irkutsk Incoherent Scatter Radar without loosing spectral resolution. The technique is based on transmitting of rectangle pulses of different duration in…

We introduce the problem of finding a satisfying assignment to a CNF formula that must further belong to a prescribed input subspace. Equivalent formulations of the problem include finding a point outside a union of subspaces (the…

Recent advances in deep neural networks (DNNs) owe their success to training algorithms that use backpropagation and gradient-descent. Backpropagation, while highly effective on von Neumann architectures, becomes inefficient when scaling to…

The Quadratic Assignment Problem (QAP) is one of the major domains in the field of evolutionary computation, and more widely in combinatorial optimization. This paper studies the phase transition of the QAP, which can be described as a…

Localizing users and mapping the environment using radio signals is a key task in emerging applications such as low-latency communications and safety-critical navigation. Recently introduced multipath-based SLAM methods can jointly localize…

Bayesian estimation with an explicit transitional prior is required for a tracking algorithm to be embedded in most multi-target tracking frameworks. This paper describes a novel approach capable of tracking maneuvering spacecraft with an…

An automated approach to reconstruct spherical Kikuchi maps from experimentally collected electron backscatter diffraction patterns and overlay each pattern onto its corresponding position on a simulated Kikuchi sphere is presented in this…

2D nesting problems rank among the most challenging cutting and packing problems. Yet, despite their practical relevance, research over the past decade has seen remarkably little progress. One reasonable explanation could be that nesting…