Filters








64 Hits in 9.0 sec

SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization

Adam Kurpisz, Aaron Potechin, Elias Samuel Wirth, Nikhil Bansal, Emanuela Merelli, James Worrell
<span title="2021-07-02">2021</span>
We connect this result to two constrained Boolean hypercube optimization problems.  ...  We study the rank of the Sum of Squares (SoS) hierarchy over the Boolean hypercube for Symmetric Quadratic Functions (SQFs) in n variables with roots placed in points k-1 and k.  ...  3s. 4.spxq ď 1 2n for all x P r3, ns.90:14 SoS Certification for SQFs and Its Connection to Boolean Hypercube OptimizationProof.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.icalp.2021.90">doi:10.4230/lipics.icalp.2021.90</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/42e7tp6dkvaf3nc4htf7fnomzi">fatcat:42e7tp6dkvaf3nc4htf7fnomzi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210707090714/https://drops.dagstuhl.de/opus/volltexte/2021/14159/pdf/LIPIcs-ICALP-2021-90.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/70/d2/70d21e3f36897dca270c93d5b9575e10c422e106.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.icalp.2021.90"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search

Artem Kaznatcheev, David Cohen, Peter Jeavons
<span title="2020-11-29">2020</span> <i title="AI Access Foundation"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4ax4efcwajcgvidb6hcg6mwx4a" style="color: black;">The Journal of Artificial Intelligence Research</a> </i> &nbsp;
First, we show that for fitness landscapes representable by binary Boolean valued constraints there is a minimal necessary constraint graph that can be easily computed.  ...  In the binary Boolean case, we prove that a degree 2 or treestructured constraint graph gives a quadratic bound on the number of improving moves made by any local search; hence, any landscape that can  ...  Artem Kaznatcheev was supported by the Theory Division at the Department of Translational Hematology and Oncology Research, Cleveland Clinic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1613/jair.1.12156">doi:10.1613/jair.1.12156</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rfzvk7jdgbekteyh5jyy4xg7dy">fatcat:rfzvk7jdgbekteyh5jyy4xg7dy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201203213621/https://www.jair.org/index.php/jair/article/download/12156/26628" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/4a/bf/4abfe5f9d5158847c1f4decc5b7325f75c10c114.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1613/jair.1.12156"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Representing fitness landscapes by valued constraints to understand the complexity of local search [article]

Artem Kaznatcheev, David A. Cohen, Peter G. Jeavons
<span title="2020-11-12">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
First, we show that for fitness landscapes representable by binary Boolean valued constraints there is a minimal necessary constraint graph that can be easily computed.  ...  In the binary Boolean case, we prove that a degree 2 or tree-structured constraint graph gives a quadratic bound on the number of improving moves made by any local search; hence, any landscape that can  ...  Artem Kaznatcheev was supported by the Theory Division at the Department of Translational Hematology and Oncology Research, Cleveland Clinic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.01218v4">arXiv:1907.01218v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mwql5medxvhdpea3zs4ebldsjq">fatcat:mwql5medxvhdpea3zs4ebldsjq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201114092627/https://arxiv.org/pdf/1907.01218v4.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9d/5b/9d5b1eda5317ca162208c8648f01ac63db43c632.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.01218v4" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Learning with Submodular Functions: A Convex Optimization Perspective [article]

Francis Bach
<span title="2013-10-08">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Submodular functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular functions and (2) the lovasz extension of submodular  ...  functions provides a useful set of regularization functions for supervised and unsupervised learning.  ...  The author would like to thank Rodolphe Jenatton, Armand Joulin, Simon Lacoste-Julien, Julien Mairal and Guillaume Obozinski for discussions related to submodular functions and convex optimization.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1111.6453v2">arXiv:1111.6453v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qsbgrxoot5f7jhss4otffr3izy">fatcat:qsbgrxoot5f7jhss4otffr3izy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200824210426/https://arxiv.org/pdf/1111.6453v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/97/7d/977d7e56bc7ea72d12ddbf58da30e3a9067f8f72.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1111.6453v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Tight Sum-of-Squares lower bounds for binary polynomial optimization problems [article]

Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
<span title="2016-05-10">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
For binary polynomial optimization problems of degree 2d and an odd number of variables n, we prove that n+2d-1/2 levels of the SoS/Lasserre hierarchy are necessary to provide the exact optimal value.  ...  She showed that the Sherali-Adams hierarchy requires n levels to detect the empty integer hull, and conjectured that the SoS/Lasserre rank for the same problem is n-1.  ...  The authors would like to express their gratitude to Alessio Benavoli for helpful discussions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1605.03019v1">arXiv:1605.03019v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fa4fy753kndgvlk6pals7jjspq">fatcat:fa4fy753kndgvlk6pals7jjspq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200910082038/https://arxiv.org/pdf/1605.03019v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a4/41/a441c200110025d8576ff4e09f0cd1ca0c26f864.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1605.03019v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Learning with Submodular Functions: A Convex Optimization Perspective

Francis Bach
<span title="">2013</span> <i title="Now Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ka2h7lkphrfvjlabybgqbnn2jq" style="color: black;">Foundations and Trends® in Machine Learning</a> </i> &nbsp;
The author would like to thank Thibaut Horel, Stefanie Jegelka, Rodolphe Jenatton, Armand Joulin, Simon Lacoste-Julien, Julien Mairal and Guillaume Obozinski for discussions related to submodular functions  ...  and convex optimization.  ...  The source is connected to all subsets G, with capacity D(G), and each subset is connected to the variables it contains, with infinite capacity.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1561/2200000039">doi:10.1561/2200000039</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kk7w6zsnsnbp3eoa6b5ol3bxbq">fatcat:kk7w6zsnsnbp3eoa6b5ol3bxbq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160720142718/http://www.di.ens.fr/~fbach/2200000039-Bach-Vol6-MAL-039.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9a/12/9a12b7accfb118c60a8aa258b33dca6d97639863.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1561/2200000039"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Positivity-preserving extensions of sum-of-squares pseudomoments over the hypercube [article]

Dmitriy Kunisky
<span title="2020-09-15">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We trace the reason that our pseudomoments can satisfy both the hypercube and positivity constraints simultaneously to a combinatorial relationship between multiharmonic polynomials and this Möbius function  ...  This connection guides our proof that the pseudomoments satisfy the hypercube constraints.  ...  Acknowledgements I thank Afonso Bandeira for many discussions and comments on an early version of the manuscript, Alex Wein for helpful discussions about hypercontractivity and tensor networks, and Ramon  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2009.07269v1">arXiv:2009.07269v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7vrqmubewjcwvjakd2doji5xi4">fatcat:7vrqmubewjcwvjakd2doji5xi4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200920225141/https://arxiv.org/pdf/2009.07269v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9b/93/9b93f559e04bb81c3819aa64d73b9ce202891997.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2009.07269v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Research on probabilistic methods for control system design

Giuseppe C. Calafiore, Fabrizio Dabbene, Roberto Tempo
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/e5pgtxytlra45muqmfmoj6kvte" style="color: black;">Automatica</a> </i> &nbsp;
A novel approach based on probability and randomization has emerged to synergize with the standard deterministic methods for control of systems with uncertainty.  ...  The focal point is on design methods, based on the interplay between uncertainty randomization and convex optimization, and on the illustration of specific control applications.  ...  The function f : R n θ × Q → {0, 1} is a (α, m)-Boolean if, for fixed q, it can be written as a Boolean expression consisting of Boolean operators involving m polynomials β 1 (θ ), . . . , β m (θ ) in  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.automatica.2011.02.029">doi:10.1016/j.automatica.2011.02.029</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pyrudohsdbdglpnekzqkh4fgoi">fatcat:pyrudohsdbdglpnekzqkh4fgoi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321152918/https://staff.polito.it/giuseppe.calafiore/Home_Page/Publications_files/Automatica_survey%20randomized_2011.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/31/ae/31aef6376dadbb72aefaca5437c5b65397be9227.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.automatica.2011.02.029"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity [article]

Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
<span title="2020-01-07">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to monotone span program size by Pitassi and Robere (2018) so that it works for any gadget with high enough rank, in  ...  length and subpolynomial line space if coefficients are restricted to be of polynomial magnitude. * We give the first explicit separation between monotone Boolean formulas and monotone real formulas.  ...  It is not hard to see that T has depth at most p and that it solves Search(Q, Z), as required. It is worth mentioning that we can prove Theorem D.1 directly, without going through Lemma D.2.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.02144v1">arXiv:2001.02144v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/urgi4cd5vvczdnsqcnqloxsj6q">fatcat:urgi4cd5vvczdnsqcnqloxsj6q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321054244/https://arxiv.org/pdf/2001.02144v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.02144v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Limits on Efficient Computation in the Physical World [article]

Scott Aaronson
<span title="2005-02-15">2005</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
complexity theory to help determine which are which.  ...  In this thesis I show that, while some intuitions from classical computer science must be jettisoned in the light of modern physics, many others emerge nearly unscathed; and I use powerful tools from computational  ...  So to lower-bound the deterministic query complexity, it suffices to lower-bound the size of any cut that splits the graph into two reasonably large components. 1 For the Boolean hypercube, Llewellyn  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/quant-ph/0412143v2">arXiv:quant-ph/0412143v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/x6mjz4h4gzaszbfgbkshgm2v3u">fatcat:x6mjz4h4gzaszbfgbkshgm2v3u</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-quant-ph0412143/quant-ph0412143.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/quant-ph/0412143v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

The Kikuchi Hierarchy and Tensor PCA [article]

Alexander S. Wein, Ahmed El Alaoui, Cristopher Moore
<span title="2019-10-01">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
It is known that AMP, the flagship algorithm of statistical physics, has substantially worse performance than SOS for tensor PCA.  ...  The results we present here apply to tensor PCA for tensors of all orders, and to k-XOR when k is even.  ...  For helpful discussions, we thank Afonso Bandeira, Sam Hopkins, Pravesh Kothari, Florent Krzakala, Tselil Schramm, Jonathan Shi, and Lenka Zdeborová.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1904.03858v2">arXiv:1904.03858v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hhudilk5mzc3dd5xwjzbbtlmaq">fatcat:hhudilk5mzc3dd5xwjzbbtlmaq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200905130540/https://arxiv.org/pdf/1904.03858v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/15/6b/156b04233bb6d5b0386cc87d258d8ea7ff8ff269.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1904.03858v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Lecture Notes on Spectral Graph Methods [article]

Michael W. Mahoney
<span title="2016-08-17">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
So, even though L isn't positive or non-negative, we get Perron-Frobenius style results for it, in addition to the results we get for it since it is a symmetric matrix.  ...  In particular, we can apply Theorem 40 to the optimal solution for LocalSpectral(G, v {u} , 1/k) and obtain a cut T whose conductance is quadratically close to the optimal value λ(G, v {u} , 1/k).  ...  If we expand the objective function and apply the constraint z s = 1, z t = 0, then Prob. (52) becomes: Consider the optimality conditions of this quadratic problem (where s are the Lagrange multipliers  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.04845v1">arXiv:1608.04845v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ppy6mlmfsvfcxedriwnndv6ztq">fatcat:ppy6mlmfsvfcxedriwnndv6ztq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200831204805/https://arxiv.org/pdf/1608.04845v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0e/9c/0e9c14e24b728ea27c6bdd472125224cf620f5b8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.04845v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

On randomization in sequential and distributed algorithms

Rajiv Gupta, Scott A. Smolka, Shaji Bhaskar
<span title="1994-03-01">1994</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/eiea26iqqjcatatlgxdpzt637y" style="color: black;">ACM Computing Surveys</a> </i> &nbsp;
Included with each algorithm is a discussion of its correctness and its computational complexity.  ...  to men of skdl; but tzme and chance happeneth to them all.  ...  The algorithm is optimal for w = 2, and evidence is supplied that it is optimal for larger values of w.KARGER, D. R. 1993.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/174666.174667">doi:10.1145/174666.174667</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mwufckvt5vawlostdlhcv7rxwm">fatcat:mwufckvt5vawlostdlhcv7rxwm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100625054323/http://www.cs.ucsb.edu/~ravenben/papers/misc/p7-gupta.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9e/5c/9e5c60863b6465b9a9eb79942e7b15b871b7b9de.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/174666.174667"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Graphical Models, Exponential Families, and Variational Inference

Martin J. Wainwright, Michael I. Jordan
<span title="">2007</span> <i title="Now Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ka2h7lkphrfvjlabybgqbnn2jq" style="color: black;">Foundations and Trends® in Machine Learning</a> </i> &nbsp;
Beyond its use as a language for formulating models, graph theory also plays a fundamental role in assessing computational 3 7  ...  Working with exponential family representations, and exploiting the conjugate duality between the cumulant function and the entropy for exponential families, we develop general variational representations  ...  Acknowledgments A large number of people contributed to the gestation of this survey, and it is a pleasure to acknowledge them here.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1561/2200000001">doi:10.1561/2200000001</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3f33bwasgvg5ndjfqezocaxxfa">fatcat:3f33bwasgvg5ndjfqezocaxxfa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809001115/http://www.jaist.ac.jp/~bao/VIASM-SML/SMLreading/GraphModels.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f1/5e/f15e7760ee44c503bf959b36f1b49f3bb3d84890.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1561/2200000001"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Algorithms for Verifying Deep Neural Networks [article]

Changliu Liu, Tomer Arnon, Christopher Lazarus, Clark Barrett, Mykel J. Kochenderfer
<span title="2020-10-15">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Deep neural networks are widely used for nonlinear function approximation with applications ranging from computer vision to control.  ...  This article surveys methods that have emerged recently for soundly verifying such properties. These methods borrow insights from reachability analysis, optimization, and search.  ...  The authors would also like to thank Christian Schilling, Marcelo Forets, and Sebastian Guadalupe, the authors of LazySets.jl, for their implementation support; Tianhao Wei for his contribution in the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1903.06758v2">arXiv:1903.06758v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/25pqxtxpfzfz7phnnsx53q3j5y">fatcat:25pqxtxpfzfz7phnnsx53q3j5y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201023120133/https://arxiv.org/ftp/arxiv/papers/1903/1903.06758.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a0/8a/a08aabe450d72b8fa6b288307e69facb4e9efa28.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1903.06758v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 64 results