Filters








43,824 Hits in 5.5 sec

Exact MAP Inference by Avoiding Fractional Vertices [article]

Erik M. Lindgren, Alexandros G. Dimakis, Adam Klivans
2017 arXiv   pre-print
We require that the number of fractional vertices in the LP relaxation exceeding the optimal solution is bounded by a polynomial in the problem size.  ...  We give a natural condition under which we can provably perform MAP inference in polynomial time.  ...  The same result (exact solution if the number of confounding vertices is bounded by a polynomial) was established by [9] for the special case of LP decoding of LDPC codes [13] .  ... 
arXiv:1703.02689v1 fatcat:sto4m3pc6bfyxajyyve6mmowfe

Inference in Polytrees with Sets of Probabilities [article]

Jose Carlos Ferreira da Rocha, Fabio Gagliardi Cozman, Cassio Polpo de Campos
2012 arXiv   pre-print
OR approximate solutions.We report ON dramatic improvements ON existing techniques FOR inference WITH probability sets AND intervals, IN SOME cases reducing the computational effort BY many orders OF  ...  ) a collection OF branch - AND - bound algorithms that combine the previous techniques.The first two techniques lead TO approximate solutions, WHILE branch - AND - bound procedures can produce either exact  ...  The work has also been supported by CNPq (through grant 3000183/98-4) and by CAPES.  ... 
arXiv:1212.2458v1 fatcat:u24tty6jdrgkrhhouxynjmktre

Block Stability for MAP Inference [article]

Hunter Lang, David Sontag, Aravindan Vijayaraghavan
2020 arXiv   pre-print
We complement our theoretical results with an empirical evaluation of real-world MAP inference instances from computer vision.  ...  To understand the empirical success of approximate MAP inference, recent work (Lang et al., 2018) has shown that some popular approximation algorithms perform very well when the input instance is stable  ...  This work was supported by NSF AitF awards CCF-1637585 and CCF-1723344. AV is also supported by NSF Grant No. CCF-1652491.  ... 
arXiv:1810.05305v2 fatcat:ayefady46rcvhjqbnisbxuopei

Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness

Sebastian Nowozin, Christoph H. Lampert
2010 SIAM Journal of Imaging Sciences  
The efficiency of the inference procedure also allows us to learn the parameters of an MRF with global connectivity potentials by means of a cutting plane algorithm.  ...  (MAP)-MRF linear program (LP) relaxations.  ...  In general, however, even if we would have started with the exact marginal polytope with only integral vertices, and another integral polytope, then their intersection could have fractional vertices and  ... 
doi:10.1137/090752614 fatcat:lkrevcg3ofeqdb7b6tsobca2qi

Generalized Collective Inference with Symmetric Clique Potentials [article]

Rahul Gupta, Sunita Sarawagi, Ajit A. Diwan
2009 arXiv   pre-print
For majority potentials, we also provide an efficient Lagrangian Relaxation based algorithm that compares favorably with the exact algorithm.  ...  Our algorithms are exact for arbitrary symmetric potentials on binary labels and for max-like and majority-like potentials on multiple labels.  ...  The solid curve plots the fraction of cliques where LR returns a MAP score better than r times the ICM MAP.  ... 
arXiv:0907.0589v2 fatcat:356yotb3ffenhpykfo2qzk3kcq

Polyhedral outer approximations with application to natural language parsing

André F. T. Martins, Noah A. Smith, Eric P. Xing
2009 Proceedings of the 26th Annual International Conference on Machine Learning - ICML '09  
This paper sheds some light on the first issue by establishing risk bounds for max-margin learning with LP relaxed inference and addresses the second issue by proposing a new paradigm that attempts to  ...  Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear.  ...  A.M. was supported by a grant from FCT/ICTI through the CMU-Portugal Program, and also by Priberam Informática. N.S. was supported by NSF IIS-0836431 and an IBM Faculty Award.  ... 
doi:10.1145/1553374.1553466 dblp:conf/icml/MartinsSX09 fatcat:d22ig2u5xfeftkbkre2gr6tq7q

Document and Corpus Level Inference For Unsupervised and Transductive Learning of Information Structure of Scientific Documents

Roi Reichart, Anna Korhonen
2012 International Conference on Computational Linguistics  
Inferring the information structure of scientific documents has proved useful for supporting information access across scientific disciplines.  ...  Acknowledgments The work in this paper was funded by the Royal Society, (UK), EPSRC (UK) grant EP/G051070/1 and EU grant 7FP-ITC-248064.  ...  In such a model, exact inference can be done efficiently using dynamic programming.  ... 
dblp:conf/coling/ReichartK12 fatcat:krzi7rxyljgydimbod7t4kl7hu

Modeling and Interpreting the Effects of Spatial Resolution on Solar Magnetic Field Maps

K. D. Leka, G. Barnes
2011 Solar Physics  
Overall, we find that areas with inferred magnetic fill fractions close to unity may be insensitive to optical spatial resolution; areas of sub-unity fill fractions are very sensitive.  ...  Further-derived quantities such as vertical current density show variations even in areas of high average magnetic fill-fraction.  ...  Canfield, who introduced her to spectropolarimetry and the interpretation of vector magnetic field maps (at 6 ′′ resolution!). We also appreciate the supportive and helpful comments from the referee.  ... 
doi:10.1007/s11207-011-9821-7 fatcat:f76nimoyzvgnlpqlwjuz6uutze

Approximate message-passing inference algorithm

Kyomin Jung, Devavrat Shah
2007 2007 IEEE Information Theory Workshop  
This remarkable connection suggests a message-passing algorithm for computing exact marginal and max-marginal in any binary MRF.  ...  paper, we exploit this property along with appropriate graph partitioning scheme to design approximate message passing algorithms for computing max-marginal of nodes or maximum a-posteriori assignment (MAP  ...  Then, compute an approximate MAP assignment by computing exact MAP restricted to the components.  ... 
doi:10.1109/itw.2007.4313078 fatcat:dlcmgel3lzf6latyfw2zbeqb5e

Magneto-optical Imaging of Transport Current Densities in Superconductors [chapter]

G. W. Crabtree, U. Welp, D. O. Gunter, W. Zhong, U. Balachandran, P. Haldar, R. S. Sokolowski, V. K. Vlasko-Vlasov, V. I. Nikitenko
1996 Advances in Superconductivity VIII  
field map of the surface produced by magneto-optical imaging is shown inFig.Ib.  ...  The contrasting light/dark vertical bands are the signature of filaments of current. (c) Current map of the same region. Solid lines indicate the outlines of the filaments.  ... 
doi:10.1007/978-4-431-66871-8_96 fatcat:r2dj6pzieba2dblobznwdlxqde

Equation of state of polydisperse hard-disk mixtures in the high-density regime

Andrés Santos, Santos B. Yuste, Mariano López de Haro, Vitaliy Ogarko
2017 Physical review. E  
The simulation results indicate that a (reduced) variance of the size distribution larger than about 0.01 is sufficient to avoid crystallization and explore the metastable fluid branch.  ...  Those data are used to assess the proposal and to infer the values of the compressibility factor of the monocomponent hard-disk fluid in the metastable region from those of mixtures in the high-density  ...  (19) allows one to infer Z s at the same packing fractions as for the mixture (i.e., the corresponding points would be joined by vertical lines, not shown). As said at the end of Sec.  ... 
doi:10.1103/physreve.96.062603 pmid:29347326 fatcat:qwy2srvo3zdrtkluuhgn4i6may

SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processes [article]

Sanyam Kapoor, Marc Finzi, Ke Alexander Wang, Andrew Gordon Wilson
2021 arXiv   pre-print
The Structured Kernel Interpolation (SKI) framework accelerates these MVMs by performing efficient MVMs on a grid and interpolating back to the original space.  ...  We additionally provide a CUDA implementation of Simplex-GP, which enables significant GPU acceleration of MVM based inference.  ...  This research is supported by an Amazon Research Award, NSF I-DISRE 193471, NIH R01DA048764-01A1, NSF IIS-1910266, and NSF 1922658 NRT-HDR: FUTURE Foundations, Translation, and Responsibility for Data  ... 
arXiv:2106.06695v1 fatcat:oiosh35unngizdbyk7xsp4tgxm

Optimality of Approximate Inference Algorithms on Stable Instances [article]

Hunter Lang, David Sontag, Aravindan Vijayaraghavan
2018 arXiv   pre-print
The goal of this paper is to partially explain the performance of alpha-expansion and an LP relaxation algorithm on MAP inference in Ferromagnetic Potts models (FPMs).  ...  Our main results give stability conditions under which these two algorithms provably recover the optimal MAP solution.  ...  This work was supported by NSF AitF awards CCF-1637585 and CCF-1723344. AV is also supported by NSF Grant No. CCF-1652491.  ... 
arXiv:1711.02195v2 fatcat:g6zhdvtrubfslkij7tg73ew3ua

ANALYSIS OF QUIET-SUN INTERNETWORK MAGNETIC FIELDS BASED ON LINEAR POLARIZATION SIGNALS

D. Orozco Suárez, L. R. Bellot Rubio
2012 Astrophysical Journal  
of the area occupied by the internetwork.  ...  The ratio between the average horizontal and vertical components of the field is approximately 3.1. The internetwork fields do not follow an isotropic distribution of orientations.  ...  This work has been partially funded by the Spanish Ministerio de Innovación y Ciencia through projects ESP2006-13030-C06-02 and PCI2006-A7-0624, and by Junta de Andalucía through Project P07-TEP-2687,  ... 
doi:10.1088/0004-637x/751/1/2 fatcat:cyu46q3xsjddbpdaka5e46mvse

RDFKB

James P. McGlothlin, Latifur R. Khan
2009 Proceedings of the 2009 International Database Engineering & Applications Symposium on - IDEAS '09  
Generally, this research has not addressed queries against inferred knowledge. Solutions which do support inference queries have done so as part of query processing.  ...  Ontologies define the rules that govern inference for RDF datasets.  ...  In prior research, the approach has been to either avoid the queries that include inference or to support these queries by translating them into unions of subqueries without inference.  ... 
doi:10.1145/1620432.1620460 dblp:conf/ideas/McGlothlinK09 fatcat:a4jslvpz2zbnzhnrikyogvgcji
« Previous Showing results 1 — 15 out of 43,824 results