The detection of gravitational waves by the LIGO-Virgo-KAGRA collaboration has ushered in a new era of observational astronomy,emphasizing the need for rapid and detailed parameter estimation and population-level anal...The detection of gravitational waves by the LIGO-Virgo-KAGRA collaboration has ushered in a new era of observational astronomy,emphasizing the need for rapid and detailed parameter estimation and population-level analyses.Traditional Bayesian inference methods,particularly Markov chain Monte Carlo,face significant computational challenges when dealing with the high-dimensional parameter spaces and complex noise characteristics inherent in gravitational wave data.This review examines the emerging role of simulation-based inference methods in gravitational wave astronomy,with a focus on approaches that leverage machine-learning techniques such as normalizing flows and neural posterior estimation.We provide a comprehensive overview of the theoretical foundations underlying various simulation-based inference methods,including neural posterior estimation,neural ratio estimation,neural likelihood estimation,flow matching,and consistency models.We explore the applications of these methods across diverse gravitational wave data processing scenarios,from single-source parameter estimation and overlapping signal analysis to testing general relativity and conducting population studies.Although these techniques demonstrate speed improvements over traditional methods in controlled studies,their model-dependent nature and sensitivity to prior assumptions are barriers to their widespread adoption.Their accuracy,which is similar to that of conventional methods,requires further validation across broader parameter spaces and noise conditions.展开更多
Extreme-mass-ratio inspiral(EMRI)signals pose significant challenges to gravitational wave(GW)data analysis,mainly owing to their highly complex waveforms and high-dimensional parameter space.Given their extended time...Extreme-mass-ratio inspiral(EMRI)signals pose significant challenges to gravitational wave(GW)data analysis,mainly owing to their highly complex waveforms and high-dimensional parameter space.Given their extended timescales of months to years and low signal-to-noise ratios,detecting and analyzing EMRIs with confidence generally relies on long-term observations.Besides the length of data,parameter estimation is particularly challenging due to non-local parameter degeneracies,arising from multiple local maxima,as well as flat regions and ridges inherent in the likelihood function.These factors lead to exceptionally high time complexity for parameter analysis based on traditional matched filtering and random sampling methods.To address these challenges,the present study explores a machine learning approach to Bayesian posterior estimation of EMRI signals,leveraging the recently developed flow matching technique based on ordinary differential equation neural networks.To our knowledge,this is also the first instance of applying continuous normalizing flows to EMRI analysis.Our approach demonstrates an increase in computational efficiency by several orders of magnitude compared to the traditional Markov chain Monte Carlo(MCMC)methods,while preserving the unbiasedness of results.However,we note that the posterior distributions generated by FMPE may exhibit broader uncertainty ranges than those obtained through full Bayesian sampling,requiring subsequent refinement via methods such as MCMC.Notably,when searching from large priors,our model rapidly approaches the true values while MCMC struggles to converge to the global maximum.Our findings highlight that machine learning has the potential to efficiently handle the vast EMRI parameter space of up to seventeen dimensions,offering new perspectives for advancing space-based GW detection and GW astronomy.展开更多
Overlapping community detection has become a very hot research topic in recent decades,and a plethora of methods have been proposed.But,a common challenge in many existing overlapping community detection approaches is...Overlapping community detection has become a very hot research topic in recent decades,and a plethora of methods have been proposed.But,a common challenge in many existing overlapping community detection approaches is that the number of communities K must be predefined manually.We propose a flexible nonparametric Bayesian generative model for count-value networks,which can allow K to increase as more and more data are encountered instead of to be fixed in advance.The Indian buffet process was used to model the community assignment matrix Z,and an uncol-lapsed Gibbs sampler has been derived.However,as the community assignment matrix Zis a structured multi-variable parameter,how to summarize the posterior inference results andestimate the inference quality about Z,is still a considerable challenge in the literature.In this paper,a graph convolutional neural network based graph classifier was utilized to help tosummarize the results and to estimate the inference qualityabout Z.We conduct extensive experiments on synthetic data and real data,and find that empirically,the traditional posterior summarization strategy is reliable.展开更多
We propose a characteristic finite element evolutionary type convection-diffusion optimal control discretization of problems. Non- divergence-free velocity fields and bilateral inequality control constraints are handl...We propose a characteristic finite element evolutionary type convection-diffusion optimal control discretization of problems. Non- divergence-free velocity fields and bilateral inequality control constraints are handled. Then some residual type a posteriori error estimates are analyzed for the approximations of the control, the state, and the adjoint state. Based on the derived error estimators, we use them as error indicators in developing efficient multi-set adaptive meshes characteristic finite element algorithm for such optimal control problems. Finally, one numerical example is given to check the feasibility and validity of multi-set adaptive meshes refinements.展开更多
This paper presents a method for unsupervised segmentation of images consisting of multiple textures. The images under study are modeled by a proposed hierarchical random field model, which has two layers. The first l...This paper presents a method for unsupervised segmentation of images consisting of multiple textures. The images under study are modeled by a proposed hierarchical random field model, which has two layers. The first layer is modeled as a Markov Random Field (MRF) representing an unobservable region image and the second layer uses 'Filters, Random and Maximum Entropy (Abb. FRAME)' model to represent multiple textures which cover each region. Compared with the traditional Hierarchical Markov Random Field (HMRF), the FRAME can use a bigger neighborhood system and model more complex patterns. The segmentation problem is formulated as Maximum a Posteriori (MAP) estimation according to the Bayesian rule. The iterated conditional modes (ICM) algorithm is carried out to find the solution of the MAP estimation. An algorithm based on the local entropy rate is proposed to simplify the estimation of the parameters of MRF. The parameters of FRAME are estimated by the ExpectationMaximum (EM) algorithm. Finally, an experiment with synthesized and real images is given, which shows that the method can segment images with complex textures efficiently and is robust to noise.展开更多
基金supported by the National Key Research and Development Program of China(2021YFC2203004)the National Natural Science Foundation of China(NSFC)(12405076,12247187,and 12147103)+1 种基金the National Astronomical Data Center(NADC2023YDS-01)the Fundamental Research Funds for the Central Universities.
文摘The detection of gravitational waves by the LIGO-Virgo-KAGRA collaboration has ushered in a new era of observational astronomy,emphasizing the need for rapid and detailed parameter estimation and population-level analyses.Traditional Bayesian inference methods,particularly Markov chain Monte Carlo,face significant computational challenges when dealing with the high-dimensional parameter spaces and complex noise characteristics inherent in gravitational wave data.This review examines the emerging role of simulation-based inference methods in gravitational wave astronomy,with a focus on approaches that leverage machine-learning techniques such as normalizing flows and neural posterior estimation.We provide a comprehensive overview of the theoretical foundations underlying various simulation-based inference methods,including neural posterior estimation,neural ratio estimation,neural likelihood estimation,flow matching,and consistency models.We explore the applications of these methods across diverse gravitational wave data processing scenarios,from single-source parameter estimation and overlapping signal analysis to testing general relativity and conducting population studies.Although these techniques demonstrate speed improvements over traditional methods in controlled studies,their model-dependent nature and sensitivity to prior assumptions are barriers to their widespread adoption.Their accuracy,which is similar to that of conventional methods,requires further validation across broader parameter spaces and noise conditions.
基金supported by the National Key Research and Development Program of China(Grant Nos.2021YFC2201901,2021YFC2203004,2020YFC2200100 and 2021YFC2201903)International Partnership Program of the Chinese Academy of Sciences(Grant No.025GJHZ2023106GC)+4 种基金the financial support from Brazilian agencies Funda??o de AmparoàPesquisa do Estado de S?o Paulo(FAPESP)Funda??o de Amparoà Pesquisa do Estado do Rio Grande do Sul(FAPERGS)Fundacao de Amparoà Pesquisa do Estado do Rio de Janeiro(FAPERJ)Conselho Nacional de Desenvolvimento Científico e Tecnológico(CNPq)Coordenacao de Aperfeicoamento de Pessoal de Nível Superior(CAPES)。
文摘Extreme-mass-ratio inspiral(EMRI)signals pose significant challenges to gravitational wave(GW)data analysis,mainly owing to their highly complex waveforms and high-dimensional parameter space.Given their extended timescales of months to years and low signal-to-noise ratios,detecting and analyzing EMRIs with confidence generally relies on long-term observations.Besides the length of data,parameter estimation is particularly challenging due to non-local parameter degeneracies,arising from multiple local maxima,as well as flat regions and ridges inherent in the likelihood function.These factors lead to exceptionally high time complexity for parameter analysis based on traditional matched filtering and random sampling methods.To address these challenges,the present study explores a machine learning approach to Bayesian posterior estimation of EMRI signals,leveraging the recently developed flow matching technique based on ordinary differential equation neural networks.To our knowledge,this is also the first instance of applying continuous normalizing flows to EMRI analysis.Our approach demonstrates an increase in computational efficiency by several orders of magnitude compared to the traditional Markov chain Monte Carlo(MCMC)methods,while preserving the unbiasedness of results.However,we note that the posterior distributions generated by FMPE may exhibit broader uncertainty ranges than those obtained through full Bayesian sampling,requiring subsequent refinement via methods such as MCMC.Notably,when searching from large priors,our model rapidly approaches the true values while MCMC struggles to converge to the global maximum.Our findings highlight that machine learning has the potential to efficiently handle the vast EMRI parameter space of up to seventeen dimensions,offering new perspectives for advancing space-based GW detection and GW astronomy.
基金supported by the National Basic Research Program of China(973)(2012CB316402)The National Natural Science Foundation of China(Grant Nos.61332005,61725205)+3 种基金The Research Project of the North Minzu University(2019XYZJK02,2019xYZJK05,2017KJ24,2017KJ25,2019MS002)Ningxia first-classdisciplinc and scientific research projects(electronic science and technology,NXYLXK2017A07)NingXia Provincial Key Discipline Project-Computer ApplicationThe Provincial Natural Science Foundation ofNingXia(NZ17111,2020AAC03219).
文摘Overlapping community detection has become a very hot research topic in recent decades,and a plethora of methods have been proposed.But,a common challenge in many existing overlapping community detection approaches is that the number of communities K must be predefined manually.We propose a flexible nonparametric Bayesian generative model for count-value networks,which can allow K to increase as more and more data are encountered instead of to be fixed in advance.The Indian buffet process was used to model the community assignment matrix Z,and an uncol-lapsed Gibbs sampler has been derived.However,as the community assignment matrix Zis a structured multi-variable parameter,how to summarize the posterior inference results andestimate the inference quality about Z,is still a considerable challenge in the literature.In this paper,a graph convolutional neural network based graph classifier was utilized to help tosummarize the results and to estimate the inference qualityabout Z.We conduct extensive experiments on synthetic data and real data,and find that empirically,the traditional posterior summarization strategy is reliable.
基金The authors would like to thank tile anonymous referees for their valuable comments and suggestions on an earlier version of this paper. This work was supported in part by the National Natural Science Foundation of China （Grant Nos. 11201485, 11171190, 11301311）, the Promotive Research Fund for Excellent Young and Middle-aged Scientists of Shandong Province （No. BS2013NJ001）, and tile Fundamental Research Funds for the Central Universities （Nos. 14CX02217A, 14CX02144A）.
文摘We propose a characteristic finite element evolutionary type convection-diffusion optimal control discretization of problems. Non- divergence-free velocity fields and bilateral inequality control constraints are handled. Then some residual type a posteriori error estimates are analyzed for the approximations of the control, the state, and the adjoint state. Based on the derived error estimators, we use them as error indicators in developing efficient multi-set adaptive meshes characteristic finite element algorithm for such optimal control problems. Finally, one numerical example is given to check the feasibility and validity of multi-set adaptive meshes refinements.
文摘This paper presents a method for unsupervised segmentation of images consisting of multiple textures. The images under study are modeled by a proposed hierarchical random field model, which has two layers. The first layer is modeled as a Markov Random Field (MRF) representing an unobservable region image and the second layer uses 'Filters, Random and Maximum Entropy (Abb. FRAME)' model to represent multiple textures which cover each region. Compared with the traditional Hierarchical Markov Random Field (HMRF), the FRAME can use a bigger neighborhood system and model more complex patterns. The segmentation problem is formulated as Maximum a Posteriori (MAP) estimation according to the Bayesian rule. The iterated conditional modes (ICM) algorithm is carried out to find the solution of the MAP estimation. An algorithm based on the local entropy rate is proposed to simplify the estimation of the parameters of MRF. The parameters of FRAME are estimated by the ExpectationMaximum (EM) algorithm. Finally, an experiment with synthesized and real images is given, which shows that the method can segment images with complex textures efficiently and is robust to noise.
