Expected Value of Partial Perfect Information
|
|
- Scarlett Pierce
- 6 years ago
- Views:
Transcription
1 Expecte Value of Partial Perfect Information Mike Giles 1, Takashi Goa 2, Howar Thom 3 Wei Fang 1, Zhenru Wang 1 1 Mathematical Institute, University of Oxfor 2 School of Engineering, University of Tokyo 3 School of Social an Community Meicine, University of Bristol MCM International Conference on Monte Carlo Methos July 4, 2017 Mike Giles (Oxfor) EVPPI July 4, / 19
2 Outline EVPI an EVPPI MLMC for neste simulation numerical analysis some numerical results using MCMC inputs conclusions Mike Giles (Oxfor) EVPPI July 4, / 19
3 Decision making uner uncertainty The motivation comes from ecision-making in funing meical research. Moels of the cost-effectiveness of meical treatments epen on various parameters. The parameter values are not known precisely, an are instea moelle as ranom variables coming from some prior istribution. The research question is whether it is worth conucting some meical research to eliminate uncertainty in some of the parameters. Similar applications arise in oil reservoir recovery is it worth sinking an aitional exploratory oil well to learn more about the oilfiel? Mike Giles (Oxfor) EVPPI July 4, / 19
4 Decision making uner uncertainty Given no knowlege of inepenent uncertain parameters X, Y, best treatment out of some finite set D correspons to max E[f (X,Y)] D while with perfect knowlege we woul have [ ] E max f (X,Y). D However, if X is known but not Y, this is reuce to [ ] E maxe[f (X,Y) X] giving a neste simulation problem. Mike Giles (Oxfor) EVPPI July 4, / 19
5 EVPI & EVPPI EVPI, the expecte value of perfect information, is the ifference [ ] EVPI = E maxf (X,Y) max E[f (X,Y)] which can be estimate with O(ε 2 ) complexity by stanar methos, assuming an O(1) cost per sample f (X,Y). EVPPI, the expecte value of partial perfect information, is the ifference [ ] EVPPI = E max E[f (X,Y) X] max E[f (X,Y)]. In practice, we choose to estimate [ ] EVPI EVPPI = E max f (X,Y) [ ] E max E[f (X,Y) X] Mike Giles (Oxfor) EVPPI July 4, / 19
6 MLMC treatment Base on work by Oxfor colleagues (Bujok, Hambly, Reisinger, 2015) Takashi Goa (arxiv, April 2016) propose an efficient MLMC estimator using 2 l samples on level l for conitional expectation. For given sample X, efine ( Z l = 1 2 max ) (a) (b) f +max f maxf where (a) f is an average of f (X,Y) over 2 l 1 inepenent samples for Y; (b) f is an average over a secon inepenent set of 2 l 1 samples; f is an average over the combine set of 2 l inner samples. Mike Giles (Oxfor) EVPPI July 4, / 19
7 MLMC treatment The expecte value of this estimator is E[Z l ] = E[max f,2 l 1] E[max f,2 l] where f,2 l is an average of 2 l inner samples, an hence L l=1 E[Z l ] = E[maxf] E[max f,2 L] E[max as L, giving us the esire estimate. f] E[maxE[f(X,Y) X] Mike Giles (Oxfor) EVPPI July 4, / 19
8 MLMC treatment How goo is the estimator? With reference to stanar MLMC theorem, γ=1, but what are α an β? Define F (X) = E[f (X,Y) X], opt (X) = argmaxf (X) so opt (x) is piecewise constant, with a lower-imensional manifol K on which it is not uniquely-efine. 1 Note that for any, 2 (f (a) (b) +f ) f = 0, so Z l =0 if the same maximises each term in Z l. Mike Giles (Oxfor) EVPPI July 4, / 19
9 Numerical analysis Heuristic analysis: (a) (b) f f = O(2 l/2 ), ue to CLT O(2 l/2 ) probability of both being within istance O(2 l/2 ) of K uner this conition, Z l = O(2 l/2 ) hence E[Z l ] = O(2 l ) an E[Zl 2] = O(2 3l/2 ), so α=1,β=3/2. It is possible to make this rigorous given some assumptions. Mike Giles (Oxfor) EVPPI July 4, / 19
10 Numerical analysis Assumptions E[ f (X,Y) p ] is finite for all p 2. Comment: helps to boun the ifference between f an F (X). There exists a constant c 0 >0 such that for all 0<ǫ<1 P(min y K X y ǫ) c 0ǫ. Comment: bouns the probability of X being close to K. There exist constants c 1,c 2 > 0 such that if X / K, then maxf (X) max F (X) > min(c 1, c 2 min X y ). opt(x) y K Comment: ensure linear separation of the optimal F away from K. Mike Giles (Oxfor) EVPPI July 4, / 19
11 Numerical analysis Builing on the heuristic analysis, an past analyses (Giles & Szpruch, 2015), we obtain the following theorem: Theorem (a) (b) If the Assumptions are satisfie, an f, f, f are as efine previously for level l, with 2 l inner samples being use for f, then for any δ>0 an E [ 1 2 (max f (a) +max ] (b) f ) max f = o(2 (1 δ)l ). ( 1 E[ 2 (max f (a) +max ) ] 2 (b) f ) max f = o(2 (3/2 δ)l ). Mike Giles (Oxfor) EVPPI July 4, / 19
12 Supporting theory Lemma If X i are ii scalar samples with zero mean, an X N is average of N samples, then for p 2, if E[ X p ] is finite then there exists a constant C p, epening only on p, such that E[ X N p ] C p N p/2 E[ X p ] P[ X N >c] C p E[ X p ]/(c 2 N) p/2. Proof. Use iscrete Burkholer-Davis-Guny inequality applie to i X i an then Markov inequality. Mike Giles (Oxfor) EVPPI July 4, / 19
13 Supporting theory Applying the result to the EVPPI problem, we get: Lemma If all moments of f are finite, then for p 2, there exists a constant C p, epening only on p, such that Proof. E[ f F p ] C p 2 pl/2 E[ f F p ] P[ f F >c] C p E[ f F p ]/(c 2 2 l ) p/2. Conitional on X, we have E[ f F p X] C p 2 pl/2 E[ f F p X] then taking an outer expectation w.r.t. X gives the esire result. A similar argument works for P[ f F >c ] E[1 f F >c ] Mike Giles (Oxfor) EVPPI July 4, / 19
14 Numerical results Real application: Cost-effectiveness of Noval Oral AntiCoagulants in Atrial Fibrillation A choice of 6 ifferent treatments, an a total of 99 input ranom variables: 34 Normal 8 uniform 15 Beta 3 sets of MCMC inputs approximate by multivariate Normals of imension 7, 7 an 28 corresponing to an aitional 42 Normals Mike Giles (Oxfor) EVPPI July 4, / 19
15 Numerical results β 1.5 α 1.0 Mike Giles (Oxfor) EVPPI July 4, / 19
16 Numerical results St MC MLMC Mike Giles (Oxfor) EVPPI July 4, / 19
17 MCMC inputs A key new challenge is that some of the ranom inputs come from a Bayesian posterior istribution, with samples generate by MCMC methos. x 1 N(0,1), x 2 N(0,1) MCMC sampler: (y 1,y 2 ) f (X,Y,Z) f MCMC sampler: (z 1,z 2 ) The stanar proceure (?) woul be to generate MCMC samples on eman, an then use them immeiately. But how can this be extene to MLMC? Mike Giles (Oxfor) EVPPI July 4, / 19
18 MCMC within MLMC An alternative iea is to first pre-generate an store a large collection of MCMC samples: {Y 1,Y 2,Y 3,...,Y N } Then, ranom samples for Y can be obtaine from this collection by uniformly istribute selection. This avois the problem of strong correlation between successive MCMC samples, an also works fine for the MLMC calculation. This approach also leas to ieas on QMC for empirical atasets, an ataset thinning, reucing the number of samples which are store. Mike Giles (Oxfor) EVPPI July 4, / 19
19 Conclusions neste simulation is an important new irection for MLMC research splitting a large set of samples into 2 or more subsets is key to a goo coupling complete numerical analysis proves O(ε 2 ) complexity numerical tests show goo benefits in some cases, but in others QMC is more effective MLQMC might be best? MCMC inputs can be introuce through ranom selection from a large pre-generate empirical ataset Webpages: community.html Mike Giles (Oxfor) EVPPI July 4, / 19
A Review of Multiple Try MCMC algorithms for Signal Processing
A Review of Multiple Try MCMC algorithms for Signal Processing Luca Martino Image Processing Lab., Universitat e València (Spain) Universia Carlos III e Mari, Leganes (Spain) Abstract Many applications
More informationTwo new developments in Multilevel Monte Carlo methods
Two new developments in Multilevel Monte Carlo methods Mike Giles Abdul-Lateef Haji-Ali Oliver Sheridan-Methven Mathematical Institute, University of Oxford Rob Scheichl s Farewell Conference University
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationarxiv: v1 [hep-lat] 19 Nov 2013
HU-EP-13/69 SFB/CPP-13-98 DESY 13-225 Applicability of Quasi-Monte Carlo for lattice systems arxiv:1311.4726v1 [hep-lat] 19 ov 2013, a,b Tobias Hartung, c Karl Jansen, b Hernan Leovey, Anreas Griewank
More informationA new proof of the sharpness of the phase transition for Bernoulli percolation on Z d
A new proof of the sharpness of the phase transition for Bernoulli percolation on Z Hugo Duminil-Copin an Vincent Tassion October 8, 205 Abstract We provie a new proof of the sharpness of the phase transition
More informationCollapsed Variational Inference for HDP
Collapse Variational Inference for HDP Yee W. Teh Davi Newman an Max Welling Publishe on NIPS 2007 Discussion le by Iulian Pruteanu Outline Introuction Hierarchical Bayesian moel for LDA Collapse VB inference
More informationModelling and simulation of dependence structures in nonlife insurance with Bernstein copulas
Moelling an simulation of epenence structures in nonlife insurance with Bernstein copulas Prof. Dr. Dietmar Pfeifer Dept. of Mathematics, University of Olenburg an AON Benfiel, Hamburg Dr. Doreen Straßburger
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationIntroduction. A Dirichlet Form approach to MCMC Optimal Scaling. MCMC idea
Introuction A Dirichlet Form approach to MCMC Optimal Scaling Markov chain Monte Carlo (MCMC quotes: Metropolis et al. (1953, running coe on the Los Alamos MANIAC: a feasible approach to statistical mechanics
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationEstimating Causal Direction and Confounding Of Two Discrete Variables
Estimating Causal Direction an Confouning Of Two Discrete Variables This inspire further work on the so calle aitive noise moels. Hoyer et al. (2009) extene Shimizu s ientifiaarxiv:1611.01504v1 [stat.ml]
More informationShort Intro to Coordinate Transformation
Short Intro to Coorinate Transformation 1 A Vector A vector can basically be seen as an arrow in space pointing in a specific irection with a specific length. The following problem arises: How o we represent
More informationAnalyzing Tensor Power Method Dynamics in Overcomplete Regime
Journal of Machine Learning Research 18 (2017) 1-40 Submitte 9/15; Revise 11/16; Publishe 4/17 Analyzing Tensor Power Metho Dynamics in Overcomplete Regime Animashree Ananumar Department of Electrical
More informationAn Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
Journal of Machine Learning Research 8 07) - Submitte /6; Publishe 5/7 An Optimal Algorithm for Banit an Zero-Orer Convex Optimization with wo-point Feeback Oha Shamir Department of Computer Science an
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationLeaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes
Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationOn conditional moments of high-dimensional random vectors given lower-dimensional projections
Submitte to the Bernoulli arxiv:1405.2183v2 [math.st] 6 Sep 2016 On conitional moments of high-imensional ranom vectors given lower-imensional projections LUKAS STEINBERGER an HANNES LEEB Department of
More informationKNN Particle Filters for Dynamic Hybrid Bayesian Networks
KNN Particle Filters for Dynamic Hybri Bayesian Networs H. D. Chen an K. C. Chang Dept. of Systems Engineering an Operations Research George Mason University MS 4A6, 4400 University Dr. Fairfax, VA 22030
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationThermal conductivity of graded composites: Numerical simulations and an effective medium approximation
JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University
More informationLinear Regression with Limited Observation
Ela Hazan Tomer Koren Technion Israel Institute of Technology, Technion City 32000, Haifa, Israel ehazan@ie.technion.ac.il tomerk@cs.technion.ac.il Abstract We consier the most common variants of linear
More informationNon-Linear Bayesian CBRN Source Term Estimation
Non-Linear Bayesian CBRN Source Term Estimation Peter Robins Hazar Assessment, Simulation an Preiction Group Dstl Porton Down, UK. probins@stl.gov.uk Paul Thomas Hazar Assessment, Simulation an Preiction
More informationOn a limit theorem for non-stationary branching processes.
On a limit theorem for non-stationary branching processes. TETSUYA HATTORI an HIROSHI WATANABE 0. Introuction. The purpose of this paper is to give a limit theorem for a certain class of iscrete-time multi-type
More information26.1 Metropolis method
CS880: Approximations Algorithms Scribe: Dave Anrzejewski Lecturer: Shuchi Chawla Topic: Metropolis metho, volume estimation Date: 4/26/07 The previous lecture iscusse they some of the key concepts of
More informationMonte Carlo Methods with Reduced Error
Monte Carlo Methos with Reuce Error As has been shown, the probable error in Monte Carlo algorithms when no information about the smoothness of the function is use is Dξ r N = c N. It is important for
More informationInfluence of weight initialization on multilayer perceptron performance
Influence of weight initialization on multilayer perceptron performance M. Karouia (1,2) T. Denœux (1) R. Lengellé (1) (1) Université e Compiègne U.R.A. CNRS 817 Heuiasyc BP 649 - F-66 Compiègne ceex -
More informationMulti-View Clustering via Canonical Correlation Analysis
Keywors: multi-view learning, clustering, canonical correlation analysis Abstract Clustering ata in high-imensions is believe to be a har problem in general. A number of efficient clustering algorithms
More informationNecessary and Sufficient Conditions for Sketched Subspace Clustering
Necessary an Sufficient Conitions for Sketche Subspace Clustering Daniel Pimentel-Alarcón, Laura Balzano 2, Robert Nowak University of Wisconsin-Maison, 2 University of Michigan-Ann Arbor Abstract This
More informationSeparation of Variables
Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical
More informationFlexible High-Dimensional Classification Machines and Their Asymptotic Properties
Journal of Machine Learning Research 16 (2015) 1547-1572 Submitte 1/14; Revise 9/14; Publishe 8/15 Flexible High-Dimensional Classification Machines an Their Asymptotic Properties Xingye Qiao Department
More informationMODELLING DEPENDENCE IN INSURANCE CLAIMS PROCESSES WITH LÉVY COPULAS ABSTRACT KEYWORDS
MODELLING DEPENDENCE IN INSURANCE CLAIMS PROCESSES WITH LÉVY COPULAS BY BENJAMIN AVANZI, LUKE C. CASSAR AND BERNARD WONG ABSTRACT In this paper we investigate the potential of Lévy copulas as a tool for
More informationarxiv: v4 [cs.ds] 7 Mar 2014
Analysis of Agglomerative Clustering Marcel R. Ackermann Johannes Blömer Daniel Kuntze Christian Sohler arxiv:101.697v [cs.ds] 7 Mar 01 Abstract The iameter k-clustering problem is the problem of partitioning
More informationRobust Low Rank Kernel Embeddings of Multivariate Distributions
Robust Low Rank Kernel Embeings of Multivariate Distributions Le Song, Bo Dai College of Computing, Georgia Institute of Technology lsong@cc.gatech.eu, boai@gatech.eu Abstract Kernel embeing of istributions
More informationA note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz
A note on asymptotic formulae for one-imensional network flow problems Carlos F. Daganzo an Karen R. Smilowitz (to appear in Annals of Operations Research) Abstract This note evelops asymptotic formulae
More informationParameter estimation: A new approach to weighting a priori information
Parameter estimation: A new approach to weighting a priori information J.L. Mea Department of Mathematics, Boise State University, Boise, ID 83725-555 E-mail: jmea@boisestate.eu Abstract. We propose a
More informationPerfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs
Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationGaussian processes with monotonicity information
Gaussian processes with monotonicity information Anonymous Author Anonymous Author Unknown Institution Unknown Institution Abstract A metho for using monotonicity information in multivariate Gaussian process
More informationInter-domain Gaussian Processes for Sparse Inference using Inducing Features
Inter-omain Gaussian Processes for Sparse Inference using Inucing Features Miguel Lázaro-Greilla an Aníbal R. Figueiras-Vial Dep. Signal Processing & Communications Universia Carlos III e Mari, SPAIN {miguel,arfv}@tsc.uc3m.es
More informationarxiv: v1 [stat.co] 23 Jun 2012
Noname manuscript No. (will be inserte by the eitor) Moments Calculation For the Doubly Truncate Multivariate Normal Density Manjunath B G Stefan Wilhelm arxiv:1206.5387v1 [stat.co] 23 Jun 2012 This version:
More informationA General Analytical Approximation to Impulse Response of 3-D Microfluidic Channels in Molecular Communication
A General Analytical Approximation to Impulse Response of 3- Microfluiic Channels in Molecular Communication Fatih inç, Stuent Member, IEEE, Bayram Cevet Akeniz, Stuent Member, IEEE, Ali Emre Pusane, Member,
More informationA PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks
A PAC-Bayesian Approach to Spectrally-Normalize Margin Bouns for Neural Networks Behnam Neyshabur, Srinah Bhojanapalli, Davi McAllester, Nathan Srebro Toyota Technological Institute at Chicago {bneyshabur,
More informationProblem 3.84 of Bergman. Consider one-dimensional conduction in a plane composite wall. The outer surfaces are exposed to a fluid at T
1/10 bergman3-84.xmc Problem 3.84 of Bergman. Consier one-imensional conuction in a plane composite wall. The outer surfaces are expose to a flui at T 5 C an a convection heat transfer coefficient of h1000
More informationRobust Bounds for Classification via Selective Sampling
Nicolò Cesa-Bianchi DSI, Università egli Stui i Milano, Italy Clauio Gentile DICOM, Università ell Insubria, Varese, Italy Francesco Orabona Iiap, Martigny, Switzerlan cesa-bianchi@siunimiit clauiogentile@uninsubriait
More informationEquilibrium in Queues Under Unknown Service Times and Service Value
University of Pennsylvania ScholarlyCommons Finance Papers Wharton Faculty Research 1-2014 Equilibrium in Queues Uner Unknown Service Times an Service Value Laurens Debo Senthil K. Veeraraghavan University
More informationLOCAL AND GLOBAL MINIMALITY RESULTS FOR A NONLOCAL ISOPERIMETRIC PROBLEM ON R N
LOCAL AND GLOBAL MINIMALITY RSULTS FOR A NONLOCAL ISOPRIMTRIC PROBLM ON R N M. BONACINI AND R. CRISTOFRI Abstract. We consier a nonlocal isoperimetric problem efine in the whole space R N, whose nonlocal
More informationA. Exclusive KL View of the MLE
A. Exclusive KL View of the MLE Lets assume a change-of-variable moel p Z z on the ranom variable Z R m, such as the one use in Dinh et al. 2017: z 0 p 0 z 0 an z = ψz 0, where ψ is an invertible function
More informationThe Exact Form and General Integrating Factors
7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily
More informationTractability results for weighted Banach spaces of smooth functions
Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March
More informationSwitching Time Optimization in Discretized Hybrid Dynamical Systems
Switching Time Optimization in Discretize Hybri Dynamical Systems Kathrin Flaßkamp, To Murphey, an Sina Ober-Blöbaum Abstract Switching time optimization (STO) arises in systems that have a finite set
More informationTopic 7: Convergence of Random Variables
Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information
More informationGLOBAL SOLUTIONS FOR 2D COUPLED BURGERS-COMPLEX-GINZBURG-LANDAU EQUATIONS
Electronic Journal of Differential Equations, Vol. 015 015), No. 99, pp. 1 14. ISSN: 107-6691. URL: http://eje.math.txstate.eu or http://eje.math.unt.eu ftp eje.math.txstate.eu GLOBAL SOLUTIONS FOR D COUPLED
More informationMulti-View Clustering via Canonical Correlation Analysis
Kamalika Chauhuri ITA, UC San Diego, 9500 Gilman Drive, La Jolla, CA Sham M. Kakae Karen Livescu Karthik Sriharan Toyota Technological Institute at Chicago, 6045 S. Kenwoo Ave., Chicago, IL kamalika@soe.ucs.eu
More informationChapter 4. Electrostatics of Macroscopic Media
Chapter 4. Electrostatics of Macroscopic Meia 4.1 Multipole Expansion Approximate potentials at large istances 3 x' x' (x') x x' x x Fig 4.1 We consier the potential in the far-fiel region (see Fig. 4.1
More informationCascaded redundancy reduction
Network: Comput. Neural Syst. 9 (1998) 73 84. Printe in the UK PII: S0954-898X(98)88342-5 Cascae reunancy reuction Virginia R e Sa an Geoffrey E Hinton Department of Computer Science, University of Toronto,
More informationEfficient Macro-Micro Scale Coupled Modeling of Batteries
A00 Journal of The Electrochemical Society, 15 10 A00-A008 005 0013-651/005/1510/A00/7/$7.00 The Electrochemical Society, Inc. Efficient Macro-Micro Scale Couple Moeling of Batteries Venkat. Subramanian,*,z
More informationMultiple Rank-1 Lattices as Sampling Schemes for Multivariate Trigonometric Polynomials
Multiple Rank-1 Lattices as Sampling Schemes for Multivariate Trigonometric Polynomials Lutz Kämmerer June 23, 2015 We present a new sampling metho that allows the unique reconstruction of (sparse) multivariate
More informationβ ˆ j, and the SD path uses the local gradient
Proceeings of the 00 Winter Simulation Conference E. Yücesan, C.-H. Chen, J. L. Snowon, an J. M. Charnes, es. RESPONSE SURFACE METHODOLOGY REVISITED Ebru Angün Jack P.C. Kleijnen Department of Information
More informationMulti-View Clustering via Canonical Correlation Analysis
Kamalika Chauhuri ITA, UC San Diego, 9500 Gilman Drive, La Jolla, CA Sham M. Kakae Karen Livescu Karthik Sriharan Toyota Technological Institute at Chicago, 6045 S. Kenwoo Ave., Chicago, IL kamalika@soe.ucs.eu
More informationApproximate Constraint Satisfaction Requires Large LP Relaxations
Approximate Constraint Satisfaction Requires Large LP Relaxations oah Fleming April 19, 2018 Linear programming is a very powerful tool for attacking optimization problems. Techniques such as the ellipsoi
More informationA simple tranformation of copulas
A simple tranformation of copulas V. Durrleman, A. Nikeghbali & T. Roncalli Groupe e Recherche Opérationnelle Créit Lyonnais France July 31, 2000 Abstract We stuy how copulas properties are moifie after
More informationNOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,
NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which
More informationA system s wave function is uniquely determined by its underlying physical state
A system s wave function is uniquely etermine by its unerlying physical state Roger Colbeck 1, an Renato Renner 2, 1 Department of Mathematics, University of York, YO10 5DD, UK 2 Institute for Theoretical
More informationRobustness and Perturbations of Minimal Bases
Robustness an Perturbations of Minimal Bases Paul Van Dooren an Froilán M Dopico December 9, 2016 Abstract Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important
More informationSensors & Transducers 2015 by IFSA Publishing, S. L.
Sensors & Transucers, Vol. 184, Issue 1, January 15, pp. 53-59 Sensors & Transucers 15 by IFSA Publishing, S. L. http://www.sensorsportal.com Non-invasive an Locally Resolve Measurement of Soun Velocity
More informationConvergence of Random Walks
Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of
More informationA Course in Machine Learning
A Course in Machine Learning Hal Daumé III 12 EFFICIENT LEARNING So far, our focus has been on moels of learning an basic algorithms for those moels. We have not place much emphasis on how to learn quickly.
More informationTrack Initialization from Incomplete Measurements
Track Initialiation from Incomplete Measurements Christian R. Berger, Martina Daun an Wolfgang Koch Department of Electrical an Computer Engineering, University of Connecticut, Storrs, Connecticut 6269,
More informationQubit channels that achieve capacity with two states
Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March
More information1. Aufgabenblatt zur Vorlesung Probability Theory
24.10.17 1. Aufgabenblatt zur Vorlesung By (Ω, A, P ) we always enote the unerlying probability space, unless state otherwise. 1. Let r > 0, an efine f(x) = 1 [0, [ (x) exp( r x), x R. a) Show that p f
More informationLocal Linear ICA for Mutual Information Estimation in Feature Selection
Local Linear ICA for Mutual Information Estimation in Feature Selection Tian Lan, Deniz Erogmus Department of Biomeical Engineering, OGI, Oregon Health & Science University, Portlan, Oregon, USA E-mail:
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y
Ph195a lecture notes, 1/3/01 Density operators for spin- 1 ensembles So far in our iscussion of spin- 1 systems, we have restricte our attention to the case of pure states an Hamiltonian evolution. Toay
More informationWEIGHTING A RESAMPLED PARTICLE IN SEQUENTIAL MONTE CARLO. L. Martino, V. Elvira, F. Louzada
WEIGHTIG A RESAMPLED PARTICLE I SEQUETIAL MOTE CARLO L. Martino, V. Elvira, F. Louzaa Dep. of Signal Theory an Communic., Universia Carlos III e Mari, Leganés (Spain). Institute of Mathematical Sciences
More informationOptimal Signal Detection for False Track Discrimination
Optimal Signal Detection for False Track Discrimination Thomas Hanselmann Darko Mušicki Dept. of Electrical an Electronic Eng. Dept. of Electrical an Electronic Eng. The University of Melbourne The University
More informationNumber of wireless sensors needed to detect a wildfire
Number of wireless sensors neee to etect a wilfire Pablo I. Fierens Instituto Tecnológico e Buenos Aires (ITBA) Physics an Mathematics Department Av. Maero 399, Buenos Aires, (C1106ACD) Argentina pfierens@itba.eu.ar
More informationarxiv: v4 [math.pr] 27 Jul 2016
The Asymptotic Distribution of the Determinant of a Ranom Correlation Matrix arxiv:309768v4 mathpr] 7 Jul 06 AM Hanea a, & GF Nane b a Centre of xcellence for Biosecurity Risk Analysis, University of Melbourne,
More information12.11 Laplace s Equation in Cylindrical and
SEC. 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential 593 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential One of the most important PDEs in physics an engineering
More informationEnergy behaviour of the Boris method for charged-particle dynamics
Version of 25 April 218 Energy behaviour of the Boris metho for charge-particle ynamics Ernst Hairer 1, Christian Lubich 2 Abstract The Boris algorithm is a wiely use numerical integrator for the motion
More informationOn the Aloha throughput-fairness tradeoff
On the Aloha throughput-fairness traeoff 1 Nan Xie, Member, IEEE, an Steven Weber, Senior Member, IEEE Abstract arxiv:1605.01557v1 [cs.it] 5 May 2016 A well-known inner boun of the stability region of
More informationMembership testing for Bernoulli and tail-dependence matrices. Daniel Krause. Matthias Scherer. Jonas Schwinn. Ralf Werner
Membership testing for Bernoulli an tail-epenence matrices Daniel Krause Chair of Mathematical Finance, Technische Universität München, Parkring 11, 85748 Garching-Hochbrück, Germany, email: aniel.krause@tum.e,
More informationHigh-Dimensional p-norms
High-Dimensional p-norms Gérar Biau an Davi M. Mason Abstract Let X = X 1,...,X be a R -value ranom vector with i.i.. components, an let X p = j=1 X j p 1/p be its p-norm, for p > 0. The impact of letting
More informationSurvey-weighted Unit-Level Small Area Estimation
Survey-weighte Unit-Level Small Area Estimation Jan Pablo Burgar an Patricia Dörr Abstract For evience-base regional policy making, geographically ifferentiate estimates of socio-economic inicators are
More informationOn the Value of Partial Information for Learning from Examples
JOURNAL OF COMPLEXITY 13, 509 544 (1998) ARTICLE NO. CM970459 On the Value of Partial Information for Learning from Examples Joel Ratsaby* Department of Electrical Engineering, Technion, Haifa, 32000 Israel
More informationLevel Construction of Decision Trees in a Partition-based Framework for Classification
Level Construction of Decision Trees in a Partition-base Framework for Classification Y.Y. Yao, Y. Zhao an J.T. Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canaa S4S
More informationMath Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors
Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+
More informationA Sketch of Menshikov s Theorem
A Sketch of Menshikov s Theorem Thomas Bao March 14, 2010 Abstract Let Λ be an infinite, locally finite oriente multi-graph with C Λ finite an strongly connecte, an let p
More informationEstimation of the Maximum Domination Value in Multi-Dimensional Data Sets
Proceeings of the 4th East-European Conference on Avances in Databases an Information Systems ADBIS) 200 Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets Eleftherios Tiakas, Apostolos.
More informationSome New Thoughts on the Multipoint Method for Reactor Physics Applications. Sandra Dulla, Piero Ravetto, Paolo Saracco,
Jeju, Korea, April 16-20, 2017, on USB 2017 Some New Thoughts on the Multipoint Metho for Reactor Physics Applications Sanra Dulla, Piero Ravetto, Paolo Saracco, Politecnico i Torino, Dipartimento Energia,
More informationON THE OPTIMALITY SYSTEM FOR A 1 D EULER FLOW PROBLEM
ON THE OPTIMALITY SYSTEM FOR A D EULER FLOW PROBLEM Eugene M. Cliff Matthias Heinkenschloss y Ajit R. Shenoy z Interisciplinary Center for Applie Mathematics Virginia Tech Blacksburg, Virginia 46 Abstract
More informationarxiv:math/ v1 [math.pr] 3 Jul 2006
The Annals of Applie Probability 006, Vol. 6, No., 475 55 DOI: 0.4/050560500000079 c Institute of Mathematical Statistics, 006 arxiv:math/0607054v [math.pr] 3 Jul 006 OPTIMAL SCALING FOR PARTIALLY UPDATING
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationCONSERVATION PROPERTIES OF SMOOTHED PARTICLE HYDRODYNAMICS APPLIED TO THE SHALLOW WATER EQUATIONS
BIT 0006-3835/00/4004-0001 $15.00 200?, Vol.??, No.??, pp.?????? c Swets & Zeitlinger CONSERVATION PROPERTIES OF SMOOTHE PARTICLE HYROYNAMICS APPLIE TO THE SHALLOW WATER EQUATIONS JASON FRANK 1 an SEBASTIAN
More informationChapter 6: Energy-Momentum Tensors
49 Chapter 6: Energy-Momentum Tensors This chapter outlines the general theory of energy an momentum conservation in terms of energy-momentum tensors, then applies these ieas to the case of Bohm's moel.
More informationTEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE
TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS Yannick DEVILLE Université Paul Sabatier Laboratoire Acoustique, Métrologie, Instrumentation Bât. 3RB2, 8 Route e Narbonne,
More informationGeneralization of the persistent random walk to dimensions greater than 1
PHYSICAL REVIEW E VOLUME 58, NUMBER 6 DECEMBER 1998 Generalization of the persistent ranom walk to imensions greater than 1 Marián Boguñá, Josep M. Porrà, an Jaume Masoliver Departament e Física Fonamental,
More information