Search results for "APPROXIMATION"
showing 10 items of 818 documents
Online shortest paths with confidence intervals for routing in a time varying random network
2018
International audience; The increase in the world's population and rising standards of living is leading to an ever-increasing number of vehicles on the roads, and with it ever-increasing difficulties in traffic management. This traffic management in transport networks can be clearly optimized by using information and communication technologies referred as Intelligent Transport Systems (ITS). This management problem is usually reformulated as finding the shortest path in a time varying random graph. In this article, an online shortest path computation using stochastic gradient descent is proposed. This routing algorithm for ITS traffic management is based on the online Frank-Wolfe approach.…
Progressive Stochastic Binarization of Deep Networks
2019
A plethora of recent research has focused on improving the memory footprint and inference speed of deep networks by reducing the complexity of (i) numerical representations (for example, by deterministic or stochastic quantization) and (ii) arithmetic operations (for example, by binarization of weights). We propose a stochastic binarization scheme for deep networks that allows for efficient inference on hardware by restricting itself to additions of small integers and fixed shifts. Unlike previous approaches, the underlying randomized approximation is progressive, thus permitting an adaptive control of the accuracy of each operation at run-time. In a low-precision setting, we match the accu…
Fast Graph Filters for Decentralized Subspace Projection
2020
A number of inference problems with sensor networks involve projecting a measured signal onto a given subspace. In existing decentralized approaches, sensors communicate with their local neighbors to obtain a sequence of iterates that asymptotically converges to the desired projection. In contrast, the present paper develops methods that produce these projections in a finite and approximately minimal number of iterations. Building upon tools from graph signal processing, the problem is cast as the design of a graph filter which, in turn, is reduced to the design of a suitable graph shift operator. Exploiting the eigenstructure of the projection and shift matrices leads to an objective whose…
The Max-Product Algorithm Viewed as Linear Data-Fusion: A Distributed Detection Scenario
2019
In this paper, we disclose the statistical behavior of the max-product algorithm configured to solve a maximum a posteriori (MAP) estimation problem in a network of distributed agents. Specifically, we first build a distributed hypothesis test conducted by a max-product iteration over a binary-valued pairwise Markov random field and show that the decision variables obtained are linear combinations of the local log-likelihood ratios observed in the network. Then, we use these linear combinations to formulate the system performance in terms of the false-alarm and detection probabilities. Our findings indicate that, in the hypothesis test concerned, the optimal performance of the max-product a…
Bayesian Analysis of Population Health Data
2021
The analysis of population-wide datasets can provide insight on the health status of large populations so that public health officials can make data-driven decisions. The analysis of such datasets often requires highly parameterized models with different types of fixed and random effects to account for risk factors, spatial and temporal variations, multilevel effects and other sources on uncertainty. To illustrate the potential of Bayesian hierarchical models, a dataset of about 500,000 inhabitants released by the Polish National Health Fund containing information about ischemic stroke incidence for a 2-year period is analyzed using different types of models. Spatial logistic regression and…
Towards nonlocal density functionals by explicit modelling of the exchange-correlation hole in inhomogeneous systems
2013
We put forward new approach for the development of a non-local density functional by a direct modeling of the shape of exchange-correlation (xc) hole in inhomogeneous systems. The functional is aimed at giving an accurate xc-energy and an accurate corresponding xc-potential even in difficult near-degeneracy situations such as molecular bond breaking. In particular we demand that: (1) the xc hole properly contains -1 electron, (2) the xc-potential has the asymptotic -1/r behavior outside finite systems and (3) the xc-potential has the correct step structure related to the derivative discontinuities of the xc-energy functional. None of the currently existing functionals satisfies all these re…
Magnetic and electronic properties of double perovskites and estimation of their Curie temperatures byab initiocalculations
2008
First principles electronic structure calculations have been carried out on ordered double perovskites Sr_2B'B"O_6 (for B' = Cr or Fe and B" 4d and 5d transition metal elements) with increasing number of valence electrons at the B-sites, and on Ba_2MnReO_6 as well as Ba_2FeMoO_6. The Curie temperatures are estimated ab initio from the electronic structures obtained with the local spin-density functional approximation, full-potential generalized gradient approximation and/or the LDA+U method (U - Hubbard parameter). Frozen spin-spirals are used to model the excited states needed to evaluate the spherical approximation for the Curie temperatures. In cases, where the induced moments on the oxy…
Fast Solution of 3D Elastodynamic Boundary Element Problems by Hierarchical Matrices
2009
In this paper a fast solver for three-dimensional elastodynamic BEM problems formulated in the Laplace transform domain is presented, implemented and tested. The technique is based on the use of hierarchical matrices for the representation of the collocation matrix for each value of the Laplace parameter of interest and uses a preconditioned GMRES for the solution of the algebraic system of equations. The preconditioner is built exploiting the hierarchical arithmetic and taking full advantage of the hierarchical format. An original strategy for speeding up the overall analysis is presented and tested. The reported numerical results demonstrate the effectiveness of the technique.
Simultaneous measurement of the muon neutrino charged-current cross section on oxygen and carbon without pions in the final state at T2K
2020
Authors: K. Abe,56 N. Akhlaq,45 R. Akutsu,57 A. Ali,32 C. Alt,11 C. Andreopoulos,54,34 L. Anthony,21 M. Antonova,19 S. Aoki,31 A. Ariga,2 T. Arihara,59 Y. Asada,69 Y. Ashida,32 E. T. Atkin,21 Y. Awataguchi,59 S. Ban,32 M. Barbi,46 G. J. Barker,66 G. Barr,42 D. Barrow,42 M. Batkiewicz-Kwasniak,15 A. Beloshapkin,26 F. Bench,34 V. Berardi,22 L. Berns,58 S. Bhadra,70 S. Bienstock,53 S. Bolognesi,6 T. Bonus,68 B. Bourguille,18 S. B. Boyd,66 A. Bravar,13 D. Bravo Berguño,1 C. Bronner,56 S. Bron,13 A. Bubak,51 M. Buizza Avanzini ,10 T. Campbell,7 S. Cao,16 S. L. Cartwright,50 M. G. Catanesi,22 A. Cervera,19 D. Cherdack,17 N. Chikuma,55 G. Christodoulou,12 M. Cicerchia,24,† J. Coleman,34 G. Collazu…
Quantum-chemical calculation of Born–Oppenheimer breakdown parameters to rotational constants
2010
The paper describes how Born–Oppenheimer breakdown parameters for the rotational constants of diatomic molecules can be determined via quantum-chemical computations. The deviations from the Born–Oppenheimer equilibrium values are accounted for by considering the adiabatic correction to the equilibrium bond distances, the electronic contribution to the rotational constant via the rotational g tensor, and the so-called Dunham correction, which can be computed directly from a polynomial expansion of the potential curve around the equilibrium distance. Calculations for HCl, SiS, and HF demonstrate the accuracy that can be achieved in the theoretical treatment of the considered Born–Oppenheimer …