相关论文: Cycle expansions with pruned orbits have branch po…

Convolutional Neural Networks (CNNs) suffer from different issues, such as computational complexity and the number of parameters. In recent years pruning techniques are employed to reduce the number of operations and model size in CNNs.…

When solving numerical constraints such as nonlinear equations and inequalities, solvers often exploit pruning techniques, which remove redundant value combinations from the domains of variables, at pruning steps. To find the complete…

We study numerically the imperfection effects in the quantum computing of the kicked rotator model in the regime of quantum chaos. It is shown that there are two types of physical characteristics: for one of them the quantum computation…

We establish a direct connection between spread complexity and quantum circuit complexity by demonstrating that spread complexity emerges as a limiting case of a circuit complexity framework built from two fundamental operations:…

Existence theory in economics is usually in real domains such as the findings of chaotic trajectories in models of economic growth, tatonnement, or overlapping generations models. Computational examples, however, sometimes converge rapidly…

Fractal basin boundaries provide an important means of characterizing chaotic systems. We apply these ideas to general relativity, where other properties such as Lyapunov exponents are difficult to define in an observer independent manner.…

Polynomial chaos is a powerful technique for propagating uncertainty through ordinary and partial differential equations. Random variables are expanded in terms of orthogonal polynomials and differential equations are derived for the…

In branching simulation, a novel approach to simulation presented in this paper, a multiplicity of plausible scenarios are concurrently developed and implemented. In conventional simulations of complex systems, there arise from time to time…

In computer algebra there are different ways of approaching the mathematical concept of functions, one of which is by defining them as solutions of differential equations. We compare different such approaches and discuss the occurring…

Chaos is widely understood as being a consequence of sensitive dependence upon initial conditions. This is the result of an instability in phase space, which separates trajectories exponentially. Here, we demonstrate that this criterion…

We investigate intermittent diffusion using cycle expansions, and show that a truncation based on cycle stability achieves reasonable convergence.

Pattern forming systems allow for a wealth of states, where wavelengths and orientation of patterns varies and defects disrupt patches of monocrystalline regions. Growth of patterns has long been recognized as a strong selection mechanism.…

A quantum system is described, whose wave function has a complexity which increases exponentially with time. Namely, for any fixed orthonormal basis, the number of components required for an accurate representation of the wave function…

The inclusion of a fragmentation mechanism in population balance equations introduces complex interactions that make the analytical or even computational treatment much more difficult than for the pure aggregation case. This is specially…

We consider the problem of extracting curve skeletons of three-dimensional, elongated objects given a noisy surface, which has applications in agricultural contexts such as extracting the branching structure of plants. We describe an…

Volume-fraction expressions are obtained for the systems of an infinite number of parallel planes arranged both regularly and randomly. As a special case of random arrangement, a non-Poissonian point process (the second-order Erlang…

When the wavefunction of a large quantum system unitarily evolves away from a low-entropy initial state, there is strong circumstantial evidence it develops "branches": a decomposition into orthogonal components that is indistinguishable…

We study the problem of complexity estimation in the context of parallelizing an advanced Branch and Bound-type algorithm over graphical models. The algorithm's pruning power makes load balancing, one crucial element of every distributed…

We investigate the gap between theory and practice for exact branching algorithms. In theory, branch-and-reduce algorithms currently have the best time complexity for numerous important problems. On the other hand, in practice,…

Network pruning is a widely-used compression technique that is able to significantly scale down overparameterized models with minimal loss of accuracy. This paper shows that pruning may create or exacerbate disparate impacts. The paper…