Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm computing”

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.

At least 1,801 records · Page 100

Synthesizing realistic sand assemblies with denoising diffusion in latent space

Abstract The shapes and morphological features of grains in sand assemblies have far‐reaching implications in many engineering applications, such as geotechnical engineering, computer animations, petroleum engineering, and concentrated solar power. Yet, our understanding of the influence of grain geometries on macroscopic response is often only qualitative, due to the limited availability of high‐quality 3D grain geometry data. In this paper, we introduce a denoising diffusion algorithm that uses a set of point clouds collected from the surface of individual sand grains to generate grains in the latent space. By employing a point cloud autoencoder, the three‐dimensional point cloud structures of sand grains are first encoded into a lower‐dimensional latent space. A generative denoising diffusion probabilistic model is trained to produce synthetic sand that maximizes the log‐likelihood of the generated samples belonging to the original data distribution measured by a Kullback‐Leibler divergence. Numerical experiments suggest that the proposed method is capable of generating realistic grains with morphology, shapes and sizes consistent with the training data inferred from an F50 sand database. We then use a rigid contact dynamic simulator to pour the synthetic sand in a confined volume to form granular assemblies in a static equilibrium state with targeted distribution properties. To ensure third‐party validation, 50,000 synthetic sand grains and the 1542 real synchrotron microcomputed tomography (SMT) scans of the F50 sand, as well as the granular assemblies composed of synthetic sand grains are made available in an open‐source repository.

Vlassis, Nikolaos N.↗

Advanced multiphysics coupling for LWR fuel performance analysis

Even the most basic nuclear fuel analysis is a multiphysics undertaking, as a credible simulation must consider at a minimum coupled heat conduction and mechanical deformation. The need for more realistic fuel modeling under a variety of conditions invariably leads to a desire to include coupling between a more complete set of the physical phenomena influencing fuel behavior, including neutronics, thermal hydraulics, and mechanisms occurring at lower length scales. This paper covers current efforts toward coupled multiphysics LWR fuel modeling in three main areas. The first area covered in this paper concerns thermomechanical coupling. The interaction of these two physics, particularly related to the feedback effect associated with heat transfer and mechanical contact at the fuel/clad gap, provides numerous computational challenges. An outline is provided of an effective approach used to manage the nonlinearities associated with an evolving gap in BISON, a nuclear fuel performance application. A second type of multiphysics coupling described here is that of coupling neutronics with thermomechanical LWR fuel performance. DeCART, a high-fidelity core analysis program based on the method of characteristics, has been coupled to BISON. DeCART provides sub-pin level resolution of the multigroup neutron flux, with resonance treatment, during a depletion or a fast transient simulation. Two-way coupling between these codes was achieved by mapping fission rate density and fast neutron flux fields from DeCART to BISON and the temperature field from BISON to DeCART while employing a Picard iterative algorithm. Finally, the need for multiscale coupling is considered. Fission gas production and evolution significantly impact fuel performance by causing swelling, a reduction in the thermal conductivity, and fission gas release. The mechanisms involved occur at the atomistic and grain scale and are therefore not the domain of a fuel performance code. However, it is possible to use lower length scale models such as those used in the mesoscale MARMOT code to compute average properties, e.g. swelling or thermal conductivity. These may then be used by an engineering-scale model. Examples of this type of multiscale, multiphysics modeling are shown.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Neoclassical equilibria as starting point for global gyrokinetic microturbulence simulations

The implementation of linearized operators describing inter- and like-species collisions in the global gyrokinetic particle-in-cell code ORB5[S. Jolliet, Comput. Phys. Commun. 177, 409 (2007)] is presented. A neoclassical axisymmetric equilibrium with self-consistent electric field can be obtained with no assumption made on the radial width of the particle trajectories. The formulation thus makes it possible to study collisional transport in regions where the neoclassical approximation breaks down such as near the magnetic axis. The numerical model is validated against both analytical results as well as other simulation codes. The effects of the poloidally asymmetric Fourier modes of the electric field are discussed, and the contribution of collisional kinetic electrons is studied. In view of subsequent gyrokinetic simulations of turbulence started from a neoclassical equilibrium, the problem of numerical noise inherent to the particle-in-cell approach is addressed. A novel algorithm for collisional gyrokinetic simulation switching between a local and a canonical Maxwellian background for, respectively, carrying out the collisional and collisionless dynamics is proposed, and its beneficial effects together with a coarse graining procedure [Y. Chen and S. E. Parker, Phys. Plasmas 14, 082301 (2007)] on noise and weight spreading reduction are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Ensuring Transient Stability With Guaranteed Region of Attraction in DC Microgrids

DC microgrids have promising applications in renewable integration due to their better energy efficiency when connecting DC components. However, they might be unstable since many loads in a DC microgrid are regulated as constant power loads (CPLs) that have a destabilizing negative impedance effect. As a result, the state trajectory displacement caused by abrupt load changes or contingencies can easily lead to instability. Many existing works have been devoted to studying the region of attraction (ROA) of a DC microgrid, in which the system is guaranteed to be asymptotically stable. Nevertheless, existing work either focuses on using numerical methods for ROA approximations that generally have no performance guarantees or cannot ensure a desired ROA for a general DC microgrid. To close this gap, this paper develops an innovative control synthesis algorithm to make a general DC microgrid have a theoretically guaranteed ROA, for example, to cover the entirety of its operating range regarding state trajectories. Here, we first study the nonlinear dynamics of a DC microgrid to derive a novel transient stability condition to rigorously certify whether a given operating range is a subset of the ROA; then, we formulate a control synthesis optimization problem to guarantee the condition’s satisfaction. This condition is a linear constraint, and the optimization problem resembles an optimal power flow problem and has a good computational behavior. Simulation case studies verify the validity of the proposed work.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantum Interior Point Methods for Semidefinite Optimization

We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction and is not guaranteed to explore only feasible points; the second scheme uses a nullspace representation of the Newton linear system to ensure feasibility even with inexact search directions. The second is a novel scheme that might seem impractical in the classical world, but it is well-suited for a hybrid quantum-classical setting. We show that both schemes converge to an optimal solution of the semidefinite optimization problem under standard assumptions. By comparing the theoretical performance of classical and quantum interior point methods with respect to various input parameters, we show that our second scheme obtains a speedup over classical algorithms in terms of the dimension of the problem n , but has worse dependence on other numerical parameters.

Augustino, Brandon↗

Study of Data-Driven Mesh-Model Optimization in System Thermal-Hydraulic Simulation

Quantification of nuclear power plant safety risk requires a systematic and yet practical approach to identification of accident scenarios, assessment of their likelihood and consequences. Instrumental to this goal is risk-informed safety margin characterization (RISMC) framework, whose realization requires computationally robust and affordable methods for sufficiently accurate simulation of complex multi-dimensional physical phenomena, such as turbulent and multi-phase flow. The CFD-like correlation-based codes with 3D simulation capability (e.g., GOTHIC) ensure computational efficiency using coarse mesh size and the sub-grid phenomena in the boundary layer that can be captured by adequate constitutive correlations. However, the error sources and user effects on the selection of mesh size and models lead to unpredictable simulation error, while rich High-Fidelity (HF) data from experiments and numerical simulation using validated code or DNS are not fully explored. It would be useful to have a “smart” data-driven multi-scale framework in which the low-resolution models can be “taught” to emulate high-resolution models. The objective of this work is to develop and evaluate a physical-based data-driven mesh-model optimization approach (Optimized Mesh/Model Information System, OMIS) to estimate the simulation error and give advice on the optimized selection of coarse mesh size and Low-Fidelity (LF) models for System Thermal Hydraulic (STH) simulation to achieve accuracy comparable to that of HF models. This approach takes advantages of computational efficiency of coarse-mesh simulation and application of Machine Learning (ML) algorithms.

97 MATHEMATICS AND COMPUTING↗

Lattice Green’s Functions for High-Order Finite Difference Stencils

Lattice Green's Functions (LGFs) are fundamental solutions to discretized linear operators, and as such they are a useful tool for solving discretized elliptic PDEs on domains that are unbounded in one or more directions. The majority of existing numerical solvers that make use of LGFs rely on a second-order discretization and operate on domains with free-space boundary conditions in all directions. Under these conditions, fast expansion methods are available that enable precomputation of 2D or 3D LGFs in linear time, avoiding the need for brute-force multi-dimensional quadrature of numerically unstable integrals. Here we focus on higher-order discretizations of the Laplace operator on domains with more general boundary conditions, by (1) providing an algorithm for fast and accurate evaluation of the LGFs associated with high-order dimension-split centered finite differences on unbounded domains, and (2) deriving closed-form expressions for the LGFs associated with both dimension-split and Mehrstellen discretizations on domains with one unbounded dimension. Through numerical experiments we demonstrate that these techniques provide LGF evaluations with near machine-precision accuracy, and that the resulting LGFs allow for numerically consistent solutions to high-order discretizations of the Poisson's equation on fully or partially unbounded 3D domains.

97 MATHEMATICS AND COMPUTING↗

Quantum-Inspired Bayesian Sampling for Uncertainty Quantification and Machine Learning (Final Technical Report)

With increasing simulation and measurement data, machine learning and artificial intelligence have been widely used in computational decision-making of complex engineering systems. The resulting tools, such as uncertainty quantification solvers, reinforcement learning, and physics-informed machine learning, have achieved great success in critical DOE tasks such as material discovery and design, energy system modeling and control, and numerical weather and climate prediction. A core topic in scientific machine learning and artificial intelligence is Bayesian inference: given an observed data set, people want to estimate the posterior distribution of a (possibly large) number of hidden parameters. Due to the flexibility and weak assumptions, Bayesian sampling has been the mainstream Bayesian inference solvers despite the rapid progress of approximate Bayesian inference. Classical Bayesian sampling methods such as Markov-chain Monte Carlo suffer from a low-acceptance rate due to the random walk nature, therefore state-of-the-art techniques use Hamiltonian Monte Carlo and its variants to efficiently draw posterior samples in a high dimension. The key idea of Hamiltonian Monte Carlo and its variants is to simulate the Hamiltonian dynamics of a classical particle with a fixed mass, and their performance significantly degrades when the posterior distribution is highly spiky or has multiple modes. Leveraging the idea of quantum physics, this project has investigated new theory, algorithms and applications of Bayesian inference (especially Bayesian sampling). The main results include: (1) novel quantum-inspired Bayesian sampling methods that can lead to better accuracy for challenging multi-modal or spiky distributions, (2) more scalable machine learning framework leveraging tensor-compressed Bayesian inference, and (3) Bayesian and sampling approaches for verifying the robustness of continuous and binary neural networks.

97 MATHEMATICS AND COMPUTING↗

Physics-Informed and Data-Driven Prediction of Residual Stress in Three-Dimensional Machining

Efficient and reliable prediction of machining-induced residual stress (RS) is a key requirement for truly integrated computational materials engineering (ICME). Currently available process modeling approaches, including empirical, analytical, and numerical methodologies lack predictive power and require substantial calibration and validation data. Moreover, most model-based approaches consider only two-dimensional (2D) (i.e., orthogonal), cutting processes. Meanwhile, industrial processes such as milling, turning, and drilling are inherently three-dimensional (3D). The present work attempts to bridge the gap between 2D and 3D through careful consideration of the process physics, including geometric, kinematic, and size-effect constraints to realize robust prediction of how RS develops in 3D machining. Using a novel in-situ experimental technique and digital image correlation (DIC) to determine equivalent Hertzian contact widths, contact pressures, and friction coefficients, the proposed methodology leverages a discretized conversion algorithm that includes multi-pass shakedown effects. This paper presents a semi-analytical model to predict machining-induced RS in 3D turning operations, which are used representatively for 3D processes more generally. Rather than follow a ‘brute force’ 3D FEM approach or conduct countless experiments to train a purely data-driven machine learning algorithm, the proposed approach builds on previous 2D modeling work. Through careful consideration of the process physics, including complex geometry/kinematic considerations of 3D turning, the authors demonstrated an experimentally calibrated approach, as well as validation based on published RS data. Model predictions and previously published measurement data of RS depth profiles for turning of Inconel 718 were compared for a range of process parameters. Correlation between the proposed 3D model and validation data was found to be within the margin of experimental error for most conditions. The proposed model appears to capture the overall behavior of 3D RS depth profiles with acceptable accuracy, particularly the key metrics of near-surface stress, peak stress magnitude and location, as well as overall stress profile depth. This report presents a physics-informed, data-driven approach for efficient calibration of a 2D model for machining-induced RS through DIC analysis of in-situ characterized subsurface displacement fields.

42 ENGINEERING↗

Accurate contrast determination for X-ray speckle visibility spectroscopy

X-ray speckle visibility spectroscopy using X-ray free-electron lasers has long been proposed as a probe of fast dynamics in noncrystalline materials. In this paper, numerical modeling is presented to show how the data interpretation of visibility spectroscopy can be impacted by the nonidealities of real-life X-ray detectors. Using simulated detector data, this work provides a detailed analysis of the systematic errors of several contrast extraction algorithms in the context of low-count-rate X-ray speckle visibility spectroscopy and their origins are discussed. Here, it was found that the finite detector charge cloud and pixel size lead to an unavoidable `degeneracy' in photon position determination, and that the contrasts extracted using different algorithms can all be corrected by a simple linear model. The results suggest that experimental calibration of the correction coefficient at the count rate of interest is possible and essential. This allows computationally lightweight algorithms to be implemented for on-the-fly analysis.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Automated temporal tracking and segmentation of lymphoma on serial CT examinations

Purpose: It is challenging to reproducibly measure and compare cancer lesions on numerous follow-up studies; the process is time-consuming and error-prone. In this paper, we show a method to automatically and reproducibly identify and segment abnormal lymph nodes in serial computed tomography (CT) exams. Methods: Our method leverages initial identification of enlarged (abnormal) lymph nodes in the baseline scan. We then identify an approximate region for the node in the follow-up scans using nonrigid image registration. The baseline scan is also used to locate regions of normal, non-nodal tissue surrounding the lymph node and to map them onto the follow-up scans, in order to reduce the search space to locate the lymph node on the follow-up scans. Adaptive region-growing and clustering algorithms are then used to obtain the final contours for segmentation. We applied our method to 24 distinct enlarged lymph nodes at multiple time points from 14 patients. The scan at the earlier time point was used as the baseline scan to be used in evaluating the follow-up scan, resulting in 70 total test cases (e.g., a series of scans obtained at 4 time points results in 3 test cases). For each of the 70 cases, a ''reference standard'' was obtained by manual segmentation by a radiologist. Assessment according to response evaluation criteria in solid tumors (RECIST) using our method agreed with RECIST assessments made using the reference standard segmentations in all test cases, and by calculating node overlap ratio and Hausdorff distance between the computer and radiologist-generated contours. Results: Compared to the reference standard, our method made the correct RECIST assessment for all 70 cases. The average overlap ratio was 80.7 {+-} 9.7% s.d., and the average Hausdorff distance was 3.2 {+-} 1.8 mm s.d. The concordance correlation between automated and manual segmentations was 0.978 (95% confidence interval 0.962, 0.984). The 100% agreement in our sample between our method and the standard with regard to RECIST classification suggests that the true disagreement rate is no more than 6%. Conclusions: Our automated lymph node segmentation method achieves excellent overall segmentation performance and provides equivalent RECIST assessment. It potentially will be useful to streamline and improve cancer lesion measurement and tracking and to improve assessment of cancer treatment response.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Final Report---Optimization Under Nonconvexity and Uncertainty: Algorithms and Software

the goal of this work was to develop new algorithmic techniques for solving large-scale numerical optimization problems, focusing on problems classes that have proven to be among the most challenging for practitioners: those involving uncertainty and those involving nonconvexity. This research advanced the state-of-the-art in solving mixed integer linear programs containing symmetry, mixed integer nonlinear programs, and stochastic optimization problems. The focus of the work done in the continuation was on Mixed Integer Nonlinear Programs (MINLP)s and Mixed Integer Linear Programs (MILP)s, especially those containing a great deal of symmetry.

97 MATHEMATICS AND COMPUTING↗

UCLA Final Technical Report for the "Community Petascale Project for Accelerator Science and Simulation”.

The UCLA Plasma Simulation Group is a major partner of the “Community Petascale Project for Accelerator Science and Simulation”. This is the final technical report. We include an overall summary, a list of publications, progress for the most recent year, and individual progress reports for each year. We have made tremendous progress during the three years. SciDAC funds have contributed to the development of a large number of skeleton codes that illustrate how to write PIC codes with a hierarchy of parallelism. These codes cover 2D and 3D as well as electrostatic solvers (which are used in beam dynamics codes and quasi-static codes) and electromagnetic solvers (which are used in plasma based accelerator codes). We also used these ideas to develop a GPU enabled version of OSIRIS. SciDAC funds were also contributed to the development of strategies to eliminate the Numerical Cerenkov Instability (NCI) which is an issue when carrying laser wakefield accelerator (LWFA) simulations in a boosted frame and when quantifying the emittance and energy spread of self-injected electron beams. This work included the development of a new code called UPIC-EMMA which is an FFT based electromagnetic PIC code and to new hybrid algorithms in OSIRIS. A new hybrid (PIC in r-z and gridless in φ) algorithm was implemented into OSIRIS. In this algorithm the fields and current are expanded into azimuthal harmonics and the complex amplitude for each harmonic is calculated separately. The contributions from each harmonic are summed and then used to push the particles. This algorithm permits modeling plasma based acceleration with some 3D effects but with the computational load of an 2D r-z PIC code. We developed a rigorously charge conserving current deposit for this algorithm. Very recently, we made progress in combining the speed up from the quasi-3D algorithm with that from the Lorentz boosted frame. SciDAC funds also contributed to the improvement and speed up of the quasi-static PIC code QuickPIC. We have also used our suite of PIC codes to make scientific discovery. Highlights include supporting FACET experiments which achieved the milestones of showing high beam loading and energy transfer efficiency from a drive electron beam to a witness electron beam and the discovery of a self-loading regime a for high gradient acceleration of a positron beam. Both of these experimental milestones were published in Nature together with supporting QuickPIC simulation results. Simulation results from QuickPIC were used on the cover of Nature in one case. We are also making progress on using highly resolved QuickPIC simulations to show that ion motion may not lead to catastrophic emittance growth for tightly focused electron bunches loaded into nonlinear wakefields. This could mean that fully self-consistent beam loading scenarios are possible. This work remains in progress. OSIRIS simulations were used to discover how 200 MeV electron rings are formed in LWFA experiments, on how to generate electrons that have a series of bunches on nanometer scale, and how to transport electron beams from (into) plasma sections into (from) conventional beam optic sections.

43 PARTICLE ACCELERATORS↗

Direct Estimation of Parameters in ODE Models Using WENDy: Weak-Form Estimation of Nonlinear Dynamics

Abstract We introduce the Weak-form Estimation of Nonlinear Dynamics (WENDy) method for estimating model parameters for non-linear systems of ODEs. Without relying on any numerical differential equation solvers, WENDy computes accurate estimates and is robust to large (biologically relevant) levels of measurement noise. For low dimensional systems with modest amounts of data, WENDy is competitive with conventional forward solver-based nonlinear least squares methods in terms of speed and accuracy. For both higher dimensional systems and stiff systems, WENDy is typically both faster (often by orders of magnitude) and more accurate than forward solver-based approaches. The core mathematical idea involves an efficient conversion of the strong form representation of a model to its weak form, and then solving a regression problem to perform parameter inference. The core statistical idea rests on the Errors-In-Variables framework, which necessitates the use of the iteratively reweighted least squares algorithm. Further improvements are obtained by using orthonormal test functions, created from a set of $$C^{\infty }$$ C ∞ bump functions of varying support sizes.We demonstrate the high robustness and computational efficiency by applying WENDy to estimate parameters in some common models from population biology, neuroscience, and biochemistry, including logistic growth, Lotka-Volterra, FitzHugh-Nagumo, Hindmarsh-Rose, and a Protein Transduction Benchmark model. Software and code for reproducing the examples is available at https://github.com/MathBioCU/WENDy .

97 MATHEMATICS AND COMPUTING↗

Developing a Computational Chemistry Framework for the Exascale Era

Within computational chemistry the NWChem package has arguably been the de facto standard for running high-accuracy numerical simulations on the most powerful supercomputers. In order to better address the challenges presented by emerging exascale architectures, the decision has been made to rewrite NWChem. Design of the resulting package, NWChemEx, has been driven by exascale computing; however, significant additional design considerations have arisen from the team's involvement with the Molecular Sciences Software Institute (MolSSI). MolSSI is a National Science Foundation initiative focused on establishing coding and data standards for the computational chemistry community. As a result, NWChemEx is built upon a general computational chemistry framework called the Simulation Development Environment (SDE) that is designed with a focus on extensibility and interoperability. The present manuscript describes the modular approach of the SDE and how it has been used to implement the self-consistent field algorithm within NWChemEx.

97 MATHEMATICS AND COMPUTING↗

Hierarchical Bayesian Modeling for Cosmology: Can NPE reliably replace MCMC?

Hierarchical neural posterior estimation has its place Hierarchical Bayesian Modeling (HBM) combined with MCMC algorithms has been shown to provide more robust and accurate inference for real-world phenomena in which nature takes a nested form. However, MCMC-based inference can be computationally expensive, and its performance often suffers for complex posterior geometries. These costs are especially pertinent for HBM. Studies have recently demonstrated the potential for a flexible, expressive, and amortized hierarchical neural posterior estimator (HNPE) built on Normalizing Flows. These studies have mostly been performed on simple datasets, or they focus on a single parameter from each level of the hierarchy. A systematic study analyzing how both hierarchical methods compare for more complex and realistic datasets is necessary before applying HNPE for scientific measurements. Here, we re-explore the theory behind HNPE and conduct comparative numerical experiments of HNPE and MCMC-based HBM methods on real and synthetic data, including strong gravitational lensing simulations. In particular, we use a suite of diagnostics to show trade-offs in terms of accuracy, precision, time to train or sample, reproducibility, and the need for expert domain knowledge. Especially for higher dimensional and complex posteriors, HNPE is expected to drastically improve on time for inference, accuracy, and precision with an upfront training time cost.

Hur, Rachel [Chicago U.] (ORCID:000900089890445X)↗

Estimating and Calibrating DER Model Parameters Using Levenberg–Marquardt Algorithm in Renewable Rich Power Grid

The proliferation of inverter-based distributed energy resources (IBDERs) has increased the number of control variables and dynamic interactions, leading to new grid control challenges. For stability analysis and designing appropriate protection controls, it is important that IBDER models are accurate. This paper focuses on the accurate estimation and parameter calibration of DER_A, a recently proposed aggregated IBDER model. In particular, we focus on the parameters of the reactive power–voltage regulation module. We formulate the problem of parameter tuning as a non-linear least square minimization problem and solve it using the Levenberg–Marquardt (LM) method. The LM method is primarily chosen due to its flexibility in adaptively selecting between the steepest descent and Gauss–Newton methods through a damping parameter. The LM approach is used to minimize the error between the actual measurements and the estimated response of the model. Further, the computational challenges posed by the numerical calculation of the Jacobian are tackled using a quasi-Newton root-finding approach. The proposed method is validated on a real feeder model in the northeastern part of the United States. The feeder is modeled in OpenDSS and the measurements thus obtained are fed to the DER_A model for calibration. The simulation results indicate that our approach is able to successfully calibrate the relevant model parameters quickly and with high accuracy, with a total sum of square error of 3.57 × 10 –7 .

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression

In statistics and machine learning, logistic regression is a widely-used supervised learning technique primarily employed for binary classification tasks. When the number of observations greatly exceeds the number of predictor variables, we present a simple, randomized sampling-based algorithm for logistic regression problem that guarantees high-quality approximations to both the estimated probabilities and the overall discrepancy of the model. Our analysis builds upon two simple structural conditions that boil down to randomized matrix multiplication, a fundamental and well-understood primitive of randomized numerical linear algebra. We analyze the properties of estimated probabilities of logistic regression when leverage scores are used to sample observations, and prove that accurate approximations can be achieved with a sample whose size is much smaller than the total number of observations. To further validate our theoretical findings, we conduct comprehensive empirical evaluations. Overall, our work sheds light on the potential of using randomized sampling approaches to efficiently approximate the estimated probabilities in logistic regression, offering a practical and computationally efficient solution for large-scale datasets.

Chowdhury, Agniva↗

Refine your search to explore more results.