Search results for "Metropolis"

showing 10 items of 43 documents

Distributed Particle Metropolis-Hastings Schemes

2018

We introduce a Particle Metropolis-Hastings algorithm driven by several parallel particle filters. The communication with the central node requires the transmission of only a set of weighted samples, one per filter. Furthermore, the marginal version of the previous scheme, called Distributed Particle Marginal Metropolis-Hastings (DPMMH) method, is also presented. DPMMH can be used for making inference on both a dynamical and static variable of interest. The ergodicity is guaranteed, and numerical simulations show the advantages of the novel schemes.

Computer scienceMonte Carlo methodErgodicity020206 networking & telecommunications02 engineering and technologyFilter (signal processing)Bayesian inferenceStatistics::ComputationSet (abstract data type)Metropolis–Hastings algorithm[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingTransmission (telecommunications)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingParticle filter[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingAlgorithmComputingMilieux_MISCELLANEOUS2018 IEEE Statistical Signal Processing Workshop (SSP)
researchProduct

Group Metropolis Sampling

2017

Monte Carlo (MC) methods are widely used for Bayesian inference and optimization in statistics, signal processing and machine learning. Two well-known class of MC methods are the Importance Sampling (IS) techniques and the Markov Chain Monte Carlo (MCMC) algorithms. In this work, we introduce the Group Importance Sampling (GIS) framework where different sets of weighted samples are properly summarized with one summary particle and one summary weight. GIS facilitates the design of novel efficient MC techniques. For instance, we present the Group Metropolis Sampling (GMS) algorithm which produces a Markov chain of sets of weighted samples. GMS in general outperforms other multiple try schemes…

Computer scienceMonte Carlo methodMarkov processSlice samplingProbability density function02 engineering and technologyMultiple-try MetropolisBayesian inferenceMachine learningcomputer.software_genre01 natural sciencesHybrid Monte Carlo010104 statistics & probabilitysymbols.namesake[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing0202 electrical engineering electronic engineering information engineering0101 mathematicsComputingMilieux_MISCELLANEOUSMarkov chainbusiness.industryRejection samplingSampling (statistics)020206 networking & telecommunicationsMarkov chain Monte CarloMetropolis–Hastings algorithmsymbolsMonte Carlo method in statistical physicsMonte Carlo integrationArtificial intelligencebusinessParticle filter[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingcomputerAlgorithmImportance samplingMonte Carlo molecular modeling
researchProduct

Impacts of COVID-19 and pandemic control measures on public transport ridership in European urban areas – The cases of Vienna, Innsbruck, Oslo, and A…

2021

The study uses the case of two regions with small and medium sized cities (Agder in Norway and the greater Innsbruck area in Austria) and two European capitals, Vienna and Oslo, to showcase the impact of the COVID-19 pandemic on public transport ridership in northern and central Europe. The comprehensive timeline of actions taken by governments and public transport providers in Austria and Norway, and their impact on public transport ridership in the first and second waves of the pandemic form the basis of a descriptive study. Comparing the data, a strong negative impact on the public transport patronage in the first wave of the pandemic was found, despite a comparable low number of cases p…

Coronavirus disease 2019 (COVID-19)Geography Planning and DevelopmentControl (management)TransportationManagement Science and Operations ResearchArticleMetropolisRidershipPandemicRegional scienceCivil and Structural EngineeringGeneral Environmental ScienceHE1-9990business.industryCOVID-19TimelineMonitoring systemUrban StudiesEuropeGeographyPublic transportAutomotive EngineeringDescriptive researchPublic transportSettlement (litigation)businessTransportation and communicationsSmall and medium-sized citiesTransportation Research Interdisciplinary Perspectives
researchProduct

Comparison of different uncertainty techniques in urban stormwater quantity and quality modelling

2011

Abstract Urban drainage models are important tools used by both practitioners and scientists in the field of stormwater management. These models are often conceptual and usually require calibration using local datasets. The quantification of the uncertainty associated with the models is a must, although it is rarely practiced. The International Working Group on Data and Models, which works under the IWA/IAHR Joint Committee on Urban Drainage, has been working on the development of a framework for defining and assessing uncertainties in the field of urban drainage modelling. A part of that work is the assessment and comparison of different techniques generally used in the uncertainty assessm…

EngineeringEnvironmental Engineering* MCMCRainmedia_common.quotation_subjectBayesian probability* Parameter probability distributionBayesian inferencecomputer.software_genre* MICAsymbols.namesake* GLUEWater QualityStatistics* Bayesian inferenceComputer SimulationQuality (business)CitiesGLUEWaste Management and Disposal* Urban drainage modelWater Science and TechnologyCivil and Structural Engineeringmedia_common* SCEM-UALikelihood Functions* Multi-objective auto-calibrationSettore ICAR/03 - Ingegneria Sanitaria-Ambientalebusiness.industryEcological ModelingUncertaintyMarkov chain Monte CarloModels TheoreticalPollutionMarkov ChainsRunoff model* UncertaintieMetropolis–Hastings algorithmsymbolsProbability distribution* AMALGAMData miningbusinessMonte Carlo MethodcomputerAlgorithmsSoftware
researchProduct

Group Importance Sampling for particle filtering and MCMC

2018

Bayesian methods and their implementations by means of sophisticated Monte Carlo techniques have become very popular in signal processing over the last years. Importance Sampling (IS) is a well-known Monte Carlo technique that approximates integrals involving a posterior distribution by means of weighted samples. In this work, we study the assignation of a single weighted sample which compresses the information contained in a population of weighted samples. Part of the theory that we present as Group Importance Sampling (GIS) has been employed implicitly in different works in the literature. The provided analysis yields several theoretical and practical consequences. For instance, we discus…

FOS: Computer and information sciencesComputer Science - Machine LearningComputer sciencePosterior probabilityMonte Carlo methodMachine Learning (stat.ML)02 engineering and technologyMultiple-try MetropolisStatistics - Computation01 natural sciencesMachine Learning (cs.LG)Computational Engineering Finance and Science (cs.CE)Methodology (stat.ME)010104 statistics & probabilitysymbols.namesake[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingStatistics - Machine LearningArtificial IntelligenceResampling0202 electrical engineering electronic engineering information engineering0101 mathematicsElectrical and Electronic EngineeringComputer Science - Computational Engineering Finance and ScienceStatistics - MethodologyComputation (stat.CO)ComputingMilieux_MISCELLANEOUSMarkov chainApplied Mathematics020206 networking & telecommunicationsMarkov chain Monte CarloStatistics::ComputationComputational Theory and MathematicsSignal ProcessingsymbolsComputer Vision and Pattern RecognitionStatistics Probability and UncertaintyParticle filter[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingAlgorithmImportance samplingDigital Signal Processing
researchProduct

A Review of Multiple Try MCMC algorithms for Signal Processing

2018

Many applications in signal processing require the estimation of some parameters of interest given a set of observed data. More specifically, Bayesian inference needs the computation of {\it a-posteriori} estimators which are often expressed as complicated multi-dimensional integrals. Unfortunately, analytical expressions for these estimators cannot be found in most real-world applications, and Monte Carlo methods are the only feasible approach. A very powerful class of Monte Carlo techniques is formed by the Markov Chain Monte Carlo (MCMC) algorithms. They generate a Markov chain such that its stationary distribution coincides with the target posterior density. In this work, we perform a t…

FOS: Computer and information sciencesComputer scienceMonte Carlo methodMachine Learning (stat.ML)02 engineering and technologyMultiple-try MetropolisBayesian inference01 natural sciencesStatistics - Computation010104 statistics & probabilitysymbols.namesakeArtificial IntelligenceStatistics - Machine Learning0202 electrical engineering electronic engineering information engineering0101 mathematicsElectrical and Electronic EngineeringComputation (stat.CO)Signal processingMarkov chainApplied MathematicsEstimator020206 networking & telecommunicationsMarkov chain Monte CarloStatistics::ComputationComputational Theory and MathematicsSignal ProcessingsymbolsSample spaceComputer Vision and Pattern RecognitionStatistics Probability and UncertaintyAlgorithm
researchProduct

Adaptive independent sticky MCMC algorithms

2018

In this work, we introduce a novel class of adaptive Monte Carlo methods, called adaptive independent sticky MCMC algorithms, for efficient sampling from a generic target probability density function (pdf). The new class of algorithms employs adaptive non-parametric proposal densities which become closer and closer to the target as the number of iterations increases. The proposal pdf is built using interpolation procedures based on a set of support points which is constructed iteratively based on previously drawn samples. The algorithm's efficiency is ensured by a test that controls the evolution of the set of support points. This extra stage controls the computational cost and the converge…

FOS: Computer and information sciencesMathematical optimizationAdaptive Markov chain Monte Carlo (MCMC)Monte Carlo methodBayesian inferenceHASettore SECS-P/05 - Econometrialcsh:TK7800-8360Machine Learning (stat.ML)02 engineering and technologyBayesian inference01 natural sciencesStatistics - Computationlcsh:Telecommunication010104 statistics & probabilitysymbols.namesakeAdaptive Markov chain Monte Carlo (MCMC); Adaptive rejection Metropolis sampling (ARMS); Bayesian inference; Gibbs sampling; Hit and run algorithm; Metropolis-within-Gibbs; Monte Carlo methods; Signal Processing; Hardware and Architecture; Electrical and Electronic EngineeringGibbs samplingStatistics - Machine Learninglcsh:TK5101-67200202 electrical engineering electronic engineering information engineeringComputational statisticsMetropolis-within-GibbsHit and run algorithm0101 mathematicsElectrical and Electronic EngineeringGaussian processComputation (stat.CO)MathematicsSignal processinglcsh:Electronics020206 networking & telecommunicationsMarkov chain Monte CarloMonte Carlo methodsHardware and ArchitectureSignal ProcessingSettore SECS-S/03 - Statistica EconomicasymbolsSettore SECS-S/01 - StatisticaStatistical signal processingGibbs samplingAdaptive rejection Metropolis sampling (ARMS)EURASIP Journal on Advances in Signal Processing
researchProduct

Grapham: Graphical models with adaptive random walk Metropolis algorithms

2008

Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementation covering several such methods, with emphasis on graphical models for directed acyclic graphs. The implemented algorithms include the seminal Adaptive Metropolis algorithm adjusting the proposal covariance according to the history of the chain and a Metropolis algorithm adjusting the proposal scale based on the observed acceptance probability. Different variants of the algorithms allow one, for example, to use these two algorithms together, employ delayed rejection and adjust several parameters of the algorithm…

FOS: Computer and information sciencesStatistics and ProbabilityMarkov chainAdaptive algorithmApplied MathematicsRejection samplingMarkov chain Monte CarloMultiple-try MetropolisStatistics - ComputationStatistics::ComputationComputational Mathematicssymbols.namesakeMetropolis–Hastings algorithmComputational Theory and MathematicssymbolsGraphical modelAlgorithmComputation (stat.CO)MathematicsGibbs samplingComputational Statistics & Data Analysis
researchProduct

The metropolis in retrospect : from the trading metropolis to the global metropolis.

2005

SummaryMetropolization is not a new phenomenon: metropolises have been around for centuries. The prime and permanent function of a metropolis is the coordination of economic activities at a world scale. This function has been applied to different activities in history, depending on technological conditions and economic organization, and consequently it generated different forms of metropolises. The resulting continuities and discontinuities in the metropolises' evolution can be understood in terms of agglomeration economies. In the pre-industrial period, the trading metropolis coordinates long range trade. The industrial revolutions generate new needs for coordination of production and give…

High-order services metropolises urban historyEconomyjel:R10Political sciencejel:R30[ SHS.ECO ] Humanities and Social Sciences/Economies and finances[SHS.ECO]Humanities and Social Sciences/Economics and Finance[SHS.ECO] Humanities and Social Sciences/Economics and FinanceHumanitiesGeneral Economics Econometrics and Financejel:N70ComputingMilieux_MISCELLANEOUSmetropolises
researchProduct

A la deriva entre cartells de cinema: una narrativa personal sobre París

2020

INTRODUCCIÓ. Les ciutats enquadrades des del cinema han construït una cultura visual amb la qual s’identifiquen els seus consumidors; imatges emblemàtiques que configuren una memòria col·lectiva. Però aquestes metròpolis només existeixen en la ficció. La realitat té poc o gens a veure amb aquestes visualitats. En aquesta investigació s’ofereix un relat alternatiu sobre la ciutat de París. MÈTODE. A partir d’una metodologia de recerca basada en l’art, s’empra la deriva com a mètode d’observació i anàlisi crítica de l’entorn urbà. L’objectiu és percebre París d’una manera alternativa a l’imaginari urbà creat pel cinema, a partir de la recerca de cartells de cinema que es troben en aquesta ciu…

HistoryDriftFotoassaigcineDerivaPhoto essayMetrópolisNarrativa personalderivalcsh:LB5-3640MetropolisCinema; Metropolis; Drift; Personal narrative; Photo essayComputer Science ApplicationsEducationFotoensayoMetròpolislcsh:Theory and practice of educationmetrópolisCinenarrativa personalCinema; Metròpolis; Deriva; Narrativa personal; FotoassaigPersonal narrativeCine; Metrópolis; Deriva; Narrativa personal; FotoensayoCinemafotoensayo
researchProduct