Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “STEEPEST DESCENT METHOD”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

2 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Gravitational production of heavy particles during and after inflation

Abstract We investigate the gravitational production of a scalar fieldχwith a mass exceeding the Hubble scale during inflationm χ ≳H I , employing both analytical and numerical approaches. We demonstrate that the steepest descent method effectively captures the epochs and yields of gravitational production in a compact and simple analytical framework. These analytical results align with the numerical solutions of the field equation. Our study covers three spacetime backgrounds: de Sitter, power-law inflation, and the Starobinsky inflation model. Within these models, we identify two distinct phases of particle production: during and after inflation. During inflation, we derive an accurate analytic expression for the particle production rate, accounting for a varying Hubble rate. After inflation, the additional burst of particle production depends on the inflaton mass around its minimum. When this mass is smaller than the Hubble scale during inflation,H I , there is no significant extra production. However, if the inflaton mass is larger, post-inflation production becomes the dominant contribution. Furthermore, we explore the implications of gravitationally produced heavy fields for dark matter abundance, assuming their cosmological stability.

Physics↗
DOE OSTI2024

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗