Filters








19,147 Hits in 4.0 sec

Linear Programming Using Limited-Precision Oracles [chapter]

Ambros Gleixner, Daniel E. Steffy
2019 Lecture Notes in Computer Science  
In this paper we introduce the idea of a limited-precision LP oracle and study how such an oracle could be used within a larger framework to compute exact precision solutions to LPs.  ...  Yet in practice, implementations typically use limited-precision arithmetic.  ...  Online supplement The online supplement is available with the Mathematical Programming publication at http://dx.doi.org/10.1007/s10107-019-01444-6.  ... 
doi:10.1007/978-3-030-17953-3_30 fatcat:aq7mgi3ymjdi3jbtfhcdqp6u2m

Linear programming using limited-precision oracles

Ambros Gleixner, Daniel E. Steffy
2019 Mathematical programming  
In this paper we introduce the idea of a limited-precision LP oracle and study how such an oracle could be used within a larger framework to compute exact precision solutions to LPs.  ...  Yet in practice, implementations typically use limited-precision arithmetic.  ...  Online supplement The online supplement is available with the Mathematical Programming publication at http://dx.doi.org/10.1007/s10107-019-01444-6.  ... 
doi:10.1007/s10107-019-01444-6 fatcat:slkfzhzqjjh5dki6shcunmqmtu

Assessing Phrase-Based Translation Models with Oracle Decoding

Guillaume Wisniewski, Alexandre Allauzen, François Yvon
2010 Conference on Empirical Methods in Natural Language Processing  
Acknowledgments Warm thanks to Houda Bouamor for helping us with the annotation tool. This work has been partly financed by OSEO, the French State Agency for Innovation, under the Quaero program.  ...  An Integer Program for Oracle Decoding To solve the combinatorial problem introduced in the previous section, we propose to cast it into an Integer Linear Programming (ILP) problem, for which many generic  ...  By casting the computation of the oracle BLEU-1 as an Integer Linear Programming (ILP) problem, we show that it is possible to efficiently compute accurate lower-bounds of this score, and report measures  ... 
dblp:conf/emnlp/WisniewskiAY10 fatcat:c4klyvos7ra37aoeyfzw4i4equ

Practical exact algorithm for trembling-hand equilibrium refinements in games

Gabriele Farina, Nicola Gatti, Tuomas Sandholm
2018 Neural Information Processing Systems  
It enables, for the first time, the use of trembling-hand refinements in practice.  ...  using an LP oracle with finite-precision arithmetics.  ...  Exact Nash equilibrium solver, using an LP oracle with arbitrary-precision arithmetics. We warm start the LP oracle with a NE found by an LP oracle that uses finite-precision arithmetics.  ... 
dblp:conf/nips/Farina0S18 fatcat:zj6qdmghtvbw3jp2wly7n63uua

Solving Linear Programming with Constraints Unknown [chapter]

Xiaohui Bei, Ning Chen, Shengyu Zhang
2015 Lecture Notes in Computer Science  
What is the value of input information in solving linear programming?  ...  Can linear programming still be efficiently solved if the returned violation is in other formats?  ...  The feasibility problem of linear programming asks to find an x ∈ R n to satisfy a number of linear constraints Ax > b.  ... 
doi:10.1007/978-3-662-47672-7_11 fatcat:ui6idf3ayveexhztowamfri2j4

Two-Time Scale Controlled Markov Chains: A Decomposition and Parallel Processing Approach

Alain Haurie, Francesco Moresino
2007 IEEE Transactions on Automatic Control  
Using results already available in the literature one formulates a limit control problem the solution of which can be obtained via an associated nondifferentiable convex programming (NDCP) problem.  ...  The interesting aspect of this implementation comes from two characteristics: (i) the oracle proposes cutting planes by solving reduced sized Markov Decision Problems (MDP) via a linear programm (LP) or  ...  More precisely, using the notations of Ref.  ... 
doi:10.1109/tac.2007.910692 fatcat:niveaiengbba7n6ys6pbzvaec4

Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra [chapter]

Sylvain Boulmé, Alexandre Maréchal
2015 Lecture Notes in Computer Science  
Our concern is the modular development of a certified static analyzer in Coq: we extend a certified abstract domain of convex polyhedra with a linearization procedure approximating polynomial expressions  ...  Because floating arithmetic would make us explicitly handle error terms at each operation, the VPL is for now limited to integers, and so is our linearization.  ...  Higher-order Programming With Correctness Diagrams Our linearization procedure detailed in Section 3.2 illustrates how we use GCL † K as a programming language for abstract computations.  ... 
doi:10.1007/978-3-319-22102-1_7 fatcat:6qfvvf4zzndgronbfjikzankji

Fully automatic and precise detection of thread safety violations

Michael Pradel, Thomas R. Gross
2012 Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12  
Concurrent, object-oriented programs often use thread-safe library classes.  ...  If a concurrent test exhibits an exception or a deadlock that cannot be triggered in any linearized execution of the test, the analysis reports a thread safety violation.  ...  [27] filter false warnings from verifying concurrent programs by using a sequential version of a program as an oracle for the concurrent program.  ... 
doi:10.1145/2254064.2254126 dblp:conf/pldi/PradelG12 fatcat:zvmew54ctneh7bhqwtw2gvxdvy

Refinement to Certify Abstract Interpretations: Illustrated on Linearization for Polyhedra

Sylvain Boulmé, Alexandre Maréchal
2018 Journal of automated reasoning  
In particular, they ignore that the latter may use hints from external untrusted imperative oracles (e.g. a linear programming solver).  ...  Hoare logic is a standard and convenient framework to reason about imperative programs. Let us explain how computations in K are equivalent to specifications of Hoare logic.  ...  Most non-linear arithmetic used in real-life programs involve floating points. Therefore, it is hard to evaluate our method on real-life programs.  ... 
doi:10.1007/s10817-018-9492-2 fatcat:bq2ztwbt5nhilesotkqanxsikq

Nonlinear Shrinkage Estimation of Large-Dimensional Covariance Matrices

Olivier Ledoit, Michael Wolf
2011 Social Science Research Network  
We show how to construct an estimator that is asymptotically equivalent to an oracle estimator suggested in previous work.  ...  As demonstrated in extensive Monte Carlo simulations, the resulting bona fide estimator can result in sizeable improvements over the sample covariance matrix and also over linear shrinkage.  ...  Sequential linear programming.  ... 
doi:10.2139/ssrn.1693836 fatcat:kyj3uo2obrhoza44eqrcpxkjh4

Fully automatic and precise detection of thread safety violations

Michael Pradel, Thomas R. Gross
2012 SIGPLAN notices  
Concurrent, object-oriented programs often use thread-safe library classes.  ...  If a concurrent test exhibits an exception or a deadlock that cannot be triggered in any linearized execution of the test, the analysis reports a thread safety violation.  ...  [27] filter false warnings from verifying concurrent programs by using a sequential version of a program as an oracle for the concurrent program.  ... 
doi:10.1145/2345156.2254126 fatcat:xjmhmnvdkzepjpj462jo4jvnq4

Nonlinear shrinkage estimation of large-dimensional covariance matrices

Olivier Ledoit, Michael Wolf
2012 Annals of Statistics  
We show how to construct an estimator that is asymptotically equivalent to an oracle estimator suggested in previous work.  ...  As demonstrated in extensive Monte Carlo simulations, the resulting bona fide estimator can result in sizeable improvements over the sample covariance matrix and also over linear shrinkage.  ...  Sequential linear programming.  ... 
doi:10.1214/12-aos989 fatcat:qxujskjzm5gi7d5b5572qgjl6i

Learning to Encode and Classify Test Executions [article]

Foivos Tsimpourlas, Ajitha Rajan, Miltiadis Allamanis
2020 arXiv   pre-print
We found the classification models for all subject programs resulted in high precision, recall and specificity, over 95%, while only training with an average 9% of the total traces.  ...  The goal in this paper is to solve the test oracle problem in a way that is general, scalable and accurate. To achieve this, we use supervised learning over test execution traces.  ...  Other test oracle work that use NNs is not used in the comparison as they do not work over execution traces, and are limited in their applicability to programs with numerical input and output which is  ... 
arXiv:2001.02444v1 fatcat:yrpl52k7mvhp3kuudgxr3c67r4

Solving Linear Programming with Constraints Unknown [article]

Xiaohui Bei, Ning Chen, Shengyu Zhang
2013 arXiv   pre-print
What is the value of input information in solving linear programming?  ...  Can linear programming still be efficiently solved if the returned violation is in other formats?  ...  The feasibility problem of linear programming asks to find an x ∈ R n to satisfy a number of linear constraints Ax > b.  ... 
arXiv:1304.1247v2 fatcat:gj7f666cgnfjvhhj55d6txsuoy

Global Convergence of Frank Wolfe on One Hidden Layer Networks [article]

Alexandre d'Aspremont, Mert Pilanci
2020 arXiv   pre-print
When using the ReLU activation function, and under tractable preconditioning assumptions on the sample data set, the linear minimization oracle used to incrementally form the solution can be solved explicitly  ...  as a second order cone program.  ...  AA acknowledges support from the French government under management of Agence Nationale de la Recherche as part of the "Investissements d'avenir" program, reference ANR-19-P3IA-0001 (PRAIRIE 3IA Institute  ... 
arXiv:2002.02208v1 fatcat:6c26uml2zbdizl4dezndbvqeqa
« Previous Showing results 1 — 15 out of 19,147 results