检索结果-内蒙古大学图书馆

arXiv 2021年

作者： Chen, Kan Bu, Zhiqi Xu, Shiyun Graduate Group of Applied Mathematics and Computational Science University of Pennsylvania United States

Sparse Group LASSO (SGL) is a regularized model for high-dimensional linear regression problems with grouped covariates. SGL applies l1 and l2 penalties on the individual predictors and group predictors, respectively, to guarantee sparse effects both on the inter-group and within-group levels. In this paper, we apply the approximate message passing (AMP) algorithm to efficiently solve the SGL problem under Gaussian random designs. We further use the recently developed state evolution analysis of AMP to derive an asymptotically exact characterization of SGL solution. This allows us to conduct multiple fine-grained statistical analyses of SGL, through which we investigate the effects of the group information and γ (proportion of `1 penalty). With the lens of various performance measures, we show that SGL with small γ benefits significantly from the group information and can outperform other SGL (including LASSO) or regularized models which does not exploit the group information, in terms of the recovery rate of signal, false discovery rate and mean squared error. Copyright © 2021, The Authors. All rights reserved.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

Why Gabor frames? Two fundamental measures of coherence and their role in model selection

Why Gabor frames? Two fundamental measures of coherence and ...

引用

作者： Bajwa, Waheed U. Calderbank, Robert Jafarpour, Sina Department of Electrical Engineering Program in Applied and Computational Mathematics Princeton University Princeton NJ 08544 United States Department of Computer Science Princeton University Princeton NJ 08544 United States

The problem of model selection arises in a number of contexts, such as subset selection in linear regression, estimation of structures in graphical models, and signal denoising. This paper studies non-asymptotic model selection for the general case of arbitrary (random or deterministic) design matrices and arbitrary nonzero entries of the signal. In this regard, it generalizes the notion of incoherence in the existing literature on model selection and introduces two fundamental measures of coherence- termed as the worst-case coherence and the average coherence-among the columns of a design matrix. It utilizes these two measures of coherence to provide an in-depth analysis of a simple, model-order agnostic one-step thresholding (OST) algorithm for model selection and proves that OST is feasible for exact as well as partial model selection as long as the design matrix obeys an easily verifiable property, which is termed as the coherence property. One of the key insights offered by the ensuing analysis in this regard is that OST can successfully carry out model selection even when methods based on convex optimization such as the lasso fail due to the rank deficiency of the submatrices of the design matrix. In addition, the paper establishes that if the design matrix has reasonably small worst-case and average coherence then OST performs near-optimally when either (i) the energy of any nonzero entry of the signal is close to the average signal energy per nonzero entry or (ii) the signal-to-noise ratio in the measurement system is not too high. Finally, two other key contributions of the paper are that (i) it provides bounds on the average coherence of Gaussian matrices and Gabor frames, and (ii) it extends the results on model selection using OST to low-complexity, model-order agnostic recovery of sparse signals with arbitrary nonzero entries. In particular, this part of the analysis in the paper implies that an Alltop Gabor frame together with OST can successfully carr

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Stochastic Controlled Averaging for Federated Learning with Communication Compression

arXiv

引用

arXiv 2023年

作者： Huang, Xinmeng Li, Ping Li, Xiaoyun The Graduate Group of Applied Mathematics and Computational Science The University of Pennsylvania United States

Communication compression, a technique aiming to reduce the information volume to be transmitted over the air, has gained great interest in Federated Learning (FL) for the potential of alleviating its communication overhead. However, communication compression brings forth new challenges in FL due to the interplay of compression-incurred information distortion and inherent characteristics of FL such as partial participation and data heterogeneity. Despite the recent development, the performance of compressed FL approaches has not been fully exploited. The existing approaches either cannot accommodate arbitrary data heterogeneity or partial participation, or require stringent conditions on compression. In this paper, we revisit the seminal stochastic controlled averaging method by proposing an equivalent but more efficient/simplified formulation with halved uplink communication costs. Building upon this implementation, we propose two compressed FL algorithms, SCALLION and SCAFCOM, to support unbiased and biased compression, respectively. Both the proposed methods outperform the existing compressed FL methods in terms of communication and computation complexities. Moreover, SCALLION and SCAFCOM accommodate arbitrary data heterogeneity and do not make any additional assumptions on compression errors. Experiments show that SCALLION and SCAFCOM can match the performance of corresponding full-precision FL approaches with substantially reduced uplink communication, and outperform recent compressed FL methods under the same communication budget. Copyright © 2023, The Authors. All rights reserved.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Novel Conservative Methods for Schrödinger Equations with Variable Coefficients over Long Time

引用

Communications in computational Physics 2014年第3期15卷 692-711页

作者： Xu Qian Yaming Chen Songhe Song Department of Mathematics and Systems Science and State Key Laboratory of High Performance ComputingNational University of Defense TechnologyChangsha 410073P.R.China Program in Applied and Computational Mathematics Princeton UniversityPrincetonNJ 08544USA School of Mathematical Sciences Queen Mary University of LondonLondon E14NSUK

In this paper,we propose a wavelet collocation splitting(WCS)method,and a Fourier pseudospectral splitting(FPSS)method as comparison,for solving onedimensional and two-dimensional Schrödinger equations with variable coefficients in quantum *** two methods can preserve the intrinsic properties of original problems as much as *** splitting technique increases the computational ***,the error estimation and some conservative properties are *** is proved to preserve the charge conservation *** global energy and momentum conservation laws can be preserved under several *** experiments are conducted during long time computations to show the performances of the proposed methods and verify the theoretical analysis.

关键词： Schrödinger equation wavelet collocation method splitting technique conservative property

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of the adaptive finite element method with the red-green refinement

引用

science China mathematics 2010年第2期53卷 499-512页

作者： ZHAO XuYing 1, 3 , HU Jun 2,? & SHI ZhongCi 1 1 State Key Laboratory of Scientific and Engineering Computing, Institute of computational mathematics and Scientific/Engineering Computing, Academy of mathematics and Systems science, Chinese Academy of sciences, Beijing 100190, China 2 Key Laboratory of mathematics and applied mathematics (Peking University), Ministry of Education and School of Mathematical sciences, Peking University, Beijing 100871, China 3 graduate University of Chinese Academy of sciences, Beijing 100190, China 1. State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 China3. Graduate University of Chinese Academy of Sciences Beijing 100190 China2. Key Laboratory of Mathematics and Applied Mathematics (Peking University) Ministry of Education and School of Mathematical Sciences Peking University Beijing 100871 China

In this paper, we analyze the convergence of the adaptive conforming P 1 element method with the red-green refinement. Since the mesh after refining is not nested into the one before, the Galerkin-orthogonality does not hold for this case. To overcome such a difficulty, we prove some quasi-orthogonality instead under some mild condition on the initial mesh (Condition A). Consequently, we show convergence of the adaptive method by establishing the reduction of some total error. To weaken the condition on the initial mesh, we propose a modified red-green refinement and prove the convergence of the associated adaptive method under a much weaker condition on the initial mesh (Condition B).

关键词： red-green refinement adaptive finite element method convergence non-nested local refinement

来源：评论

学校读者我要写书评

暂无评论

Nuclear Neural Networks: Emulating Late Burning Stages in Core Collapse Supernova Progenitors

arXiv

引用

arXiv 2025年

作者： Grichener, Aldana Renzo, Mathieu Kerzendorf, Wolfgang E. Farmer, Rob de Mink, Selma E. Bellinger, Earl Patrick Chan, Chi-Kwan Chen, Nutan Farag, Ebraheem Justham, Stephen Steward Steward Observatory Department of Astronomy University of Arizona 933 North Cherry Avenue TucsonAZ85721 United States Max Planck Institute for Astrophysics Karl-Schwarzschild-Str. 1 Garching85748 Germany Department of Physics Technion Haifa3200003 Israel Department of Computational Mathematics Science and Engineering Michigan State University East LansingMI48824 United States Department of Physics and Astronomy Michigan State University East LansingMI48824 United States Ludwig-Maximilians-Universitat Munchen Geschwister-Scholl-Platz 1 Munchen80539 Germany Department of Astronomy Yale University New HavenCT06511 United States Steward Observatory Department of Astronomy University of Arizona 933 North Cherry Avenue TucsonAZ85721 United States Data Science Institute University of Arizona 1230 N. Cherry Avenue TucsonAZ85721 United States Program in Applied Mathematics University of Arizona 617 North Santa Rita TucsonAZ85721 United States Machine Learning Research Lab Volkswagen AG Munich38440 Germany

One of the main challenges in modeling massive stars to the onset of core collapse is the computational bottleneck of nucleosynthesis during advanced burning stages. The number of isotopes formed requires solving a large set of fully-coupled stiff ordinary differential equations (ODEs), making the simulations computationally intensive and prone to numerical instability. To overcome this barrier, we design a nuclear neural network (NNN) framework with multiple hidden layers to emulate nucleosynthesis calculations and conduct a proof-of-concept to evaluate its performance. The NNN takes the temperature, density and composition of a burning region as input and predicts the resulting isotopic abundances along with the energy generation and loss rates. We generate training sets for initial conditions corresponding to oxygen core depletion and beyond using large nuclear reaction networks, and compare the predictions of the NNNs to results from a commonly used small net. We find that the NNNs improve the accuracy of the electron fraction by 280 − 660 % and the nuclear energy generation by 250 − 750 %, consistently outperforming the small network across all timesteps. They also achieve significantly better predictions of neutrino losses on relatively short timescales, with improvements ranging from 100 − 106 %. While further work is needed to enhance their accuracy and applicability to different stellar conditions, integrating NNN trained models into stellar evolution codes is promising for facilitating large-scale generation of core-collapse supernova (CCSN) progenitors with higher physical fidelity. © 2025, CC BY.

关键词： Nucleosynthesis

来源：评论

学校读者我要写书评

暂无评论

TSP cuts which do not conform to the template paradigm 5th

引用

5th International Conference on Mobile Agents, MA 2001

作者： Applegate, David Bixby, Robert Chvátal, Vašek Cook, William Algorithms and Optimization Department AT and T Labs – Research Florham ParkNJ07932 United States Computational and Applied Mathematics Rice University HoustonTX77005 United States Department of Computer Science Rutgers University PiscatawayNJ08854 United States Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States

ISBN: (纸本)3540428771

The first computer implementation of the Dantzig-Fulkerson- Johnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequalities as well as cutting planes of Gomory’s type. The practice of looking for and using cuts that match prescribed templates in conjunction with Gomory cuts was continued in computer codes of Miliotis, Land, and Fleischmann. Gr¨otschel, Padberg, and Hong advocated a different policy, where the template paradigm is the only source of cuts;furthermore, they argued for drawing the templates exclusively from the set of linear inequalities that induce facets of the TSP polytope. These policies were adopted in the work of Crowder and Padberg, in the work of Gr¨otschel and Holland, and in the work of Padberg and Rinaldi;their computer codes produced the most impressive computational TSP successes of the nineteen eighties. Eventually, the template paradigm became the standard frame of reference for cutting planes in the TSP. The purpose of this paper is to describe a technique for finding cuts that disdains all understanding of the TSP polytope and bashes on regardless of all prescribed templates. Combining this technique with the traditional template approach was a crucial step in our solutions of a 13,509-city TSP instance and a 15,112-city TSP instance. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Local order metrics for many-particle systems across length scales

引用

Physical Review Research 2024年第3期6卷 033262页

作者： Charles Emmett Maher Salvatore Torquato Department of Chemistry Department of Physics Princeton Institute for the Science and Technology of Materials Program in Applied and Computational Mathematics

Formulating order metrics that sensitively quantify the degree of order/disorder in many-particle systems in d-dimensional Euclidean space Rd across length scales is an outstanding challenge in physics, chemistry, and materials science. Since an infinite set of n-particle correlation functions is required to fully characterize a system, one must settle for a reduced set of structural information, in practice. We initiate a program to use the local number variance σN2(R) associated with a spherical sampling window of radius R (which encodes pair correlations) and an integral measure derived from it ΣN(Ri,Rj) that depends on two specified radial distances Ri and Rj. Across the first three space dimensions (d=1,2,3), we find these metrics can sensitively describe and categorize the degree of order/disorder of 41 different models of antihyperuniform, nonhyperuniform, disordered hyperuniform, and ordered hyperuniform many-particle systems at a specified length scale R. Using our local variance metrics, we demonstrate the importance of assessing order/disorder with respect to a specific value of R. These local order metrics could also aid in the inverse design of structures with prescribed length-scale-specific degrees of order/disorder that yield desired physical properties. In future work, it would be fruitful to explore the use of higher-order moments of the number of points within a spherical window of radius R [S. Torquato et al., Phys. Rev. X 11, 021028 (2021)] to devise even more sensitive order metrics.

关键词： Classical statistical mechanics

来源：评论

学校读者我要写书评

暂无评论

Accelerating the complex Hessenberg QR algorithm with the csx600 floating-point coprocessor

Accelerating the complex Hessenberg QR algorithm with the cs...

引用

19th IASTED International Conference on Parallel and Distributed Computing and Systems

作者： Yamamoto, Yusaku Miyata, Takafumi Nakamura, Yoshimasa Dept. of Computational Science and Engineering Graduate School of Engineering Nagoya University Nagoya 464-8603 Japan Dept. of Applied Mathematics and Physics Graduate School of Informatics Kyoto University/ JST SORST Kyoto 606-8501 Japan

ISBN: (纸本)9780889867048

In this paper, we show how to speed up the Hessenberg QR algorithm for computing the eigenvalues of a dense complex nonsymmetric matrix using the CSX600 floating-point coprocessor. Our approach is based on the small-bulge multishift QR algorithm proposed by Braman et al. This algorithm can perform a major part of the computation in the form of matrix multiplication and is therefore very suited to high performance architectures. However, to exploit the potential of the CSX600, the number of shifts must be increased to more than two hundred. In that case, the parts other than matrix multiplication begin to occupy a considerable percentage of the execution time, thereby limiting the speedup. To solve this problem, we focus on two most time-consuming parts in the algorithm except for matrix multiplication: accumulation of bulge-chasing transformations and solution of a decoupled small eigenproblem. We reconstruct the former as a recursive algorithm and apply a blocking technique to the latter. This enables these parts to be computed also using matrix multiplication. As a result of these optimizations, we obtained up to 3.8 times speedup with the CSX600 processor over a 3.2GHz Xeon processor when computing the eigenvalues of a 12,000 × 12,000 complex Hessenberg matrix.

关键词： Coprocessor

来源：评论

学校读者我要写书评

暂无评论

Modelling of Motion of a Volvox Colony using Many-Body System and Its Qualitative Comparison with Observations 9

Modelling of Motion of a Volvox Colony using Many-Body Syste...

引用

9th Asian Physics Symposium 2021, APS 2021

作者： Dini, Septian Ulan Nurafni, Sevi Fairuza, Achmad Zacky Taufik, Intan Master Program in Physics Faculty of Mathematics and Natural Science InstitutTeknologi Bandung Bandung40132 Indonesia Master Program in Computational Science Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung Bandung40132 Indonesia Master Program in Nanotechnology Graduate School Institut Teknologi Bandung Bandung40132 Indonesia School of Life Science and Technology Institut Teknologi Bandung40132 Indonesia

Approximately 500-60,000 volvox cells constructed a colony with a spherical or elliptical hollow form. Each cell can use its flagella to move. For a colony of hundred cells to perform a direct motion, there must be a coordination of the flagella. In this work, we assume that the cells already form the spherical colony and can perform some simple motion types, i.e., translational (TRAN), roll (ROLL), spin (SPIN), and superposition of the motions, and neglect detail of each flagellum. It is possible to map each cell in the colony using angular positions with a constant radius R and different θ _i and φ_i, where i = 1, 2,..., N with N is the number of cells constructing a colony. The center of the colony is R = (x, y, z). The TRAN mode can be obtained, wherex(t) = x(0) + vxt, y(t) = y(0) + vyt, z(t) = z(0) +vzt, ROLLmode with θ(t) = ω(0) + ωθt and SPIN with φ(t) = ω(0) + ωφt. Through the available observation video, the model of volvox colony motion is also shown to have a qualitative agreement. © Published under licence by IOP Publishing Ltd.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：