Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,922 papers · 148 categories

Trend · papers per month

3617211,0821,442 · Jun 202019922001200920172026
48 results for radiative transfer models

New model predicts radiative properties of nanoparticle layers with high accuracy and uncertainty.

problem Predicting radiative properties of nanoparticle embedded layers accurately and with uncertainty.
method Conditional normalizing flows learn conditional distributions of optical outputs given input parameters.
result The model achieves high predictive accuracy and reliable uncertainty estimates.

Efficient neural network speeds up radiative transfer model processing for climate change analysis.

problem Computational inefficiency in processing spectroscopy data for climate change analysis.
method Developed an algorithm using neural networks to emulate radiative transfer models (RTMs), significantly reducing processing time.
result Multifold speedup in processing time for radiative transfer models, enabling their use with high volume imaging spectrometers.

ClimART dataset benchmarks ML emulators for atmospheric RT in climate models.

problem Lack of a comprehensive dataset and standardized practices for ML benchmarking in climate models.
method Builds ClimART, a large dataset with over 10 million samples, and presents novel baselines.
result Indicates shortcomings of prior datasets and network architectures.

RADIS uses deep regression to create efficient importance sampling for model inversion and emulation.

problem Efficiently sampling from posterior distributions for model inversion and emulation.
method RADIS uses a deep architecture of nested importance sampling schemes to construct a non-parametric emulator that mimics the posterior distribution.
result RADIS asymptotically converges to an exact sampler under mild conditions and can be used as a surrogate model.

New geometrization of gravitational wave phase space.

problem Understanding the geometry of null-infinity in asymptotically flat space-times.
method Proposes a new geometrization using tractor calculus adapted to degenerate conformal metrics.
result Gravitational waves correspond to a class of tractor connections called 'null-normal'.

Consider a broken geodesics α([0,l])α([0,l]) on a compact Riemannian manifold (M,g)(M,g) with boundary of dimension n3n\geq 3. The broken geodesics are unions of two geodesics with the property that they have a common end point. Assume that for every broken geodesic α([0,l])α([0,l]) starting at and ending to the boundary M\partial M

2007-03-17abs ↗pdf ↗

This thesis advances algorithms and software for QMC, GP, and sciML.

problem Efficient high-dimensional integration, interpolation, and PDE modeling.
method Developed new algorithms and software for QMC, GP, and sciML.
result Efficient and accurate methods for high-dimensional problems.

Neural network model improves leaf spectral reflectance prediction for grapevines.

problem Inaccurate modeling of grapevine leaf spectral reflectance from traits.
method Multi-head attention neural network trained on grapevine-specific data.
result Model achieved high accuracy (R^2=0.84, NRMSE=1.52%) and outperformed PROSPECT-PRO.

Solving inverse problems is central to geosciences and remote sensing. Radiative transfer models (RTMs) represent mathematically the physical laws which govern the phenomena in remote sensing applications (forward models). The numerical inversion of the RTM equations is a challenging and computationally demanding probl…

2017-11-14abs ↗pdf ↗

DiTSNe-Ia model accurately reconstructs supernovae spectra from light curves.

problem Difficult identification and interpretation of diverse sub-populations of supernovae.
method Variational diffusion-based generative model conditioned on light curves.
result DiTSNe-Ia achieves significantly more accurate reconstructions than SALT3 across all phases.

X-TFC solves parametric DEs with neural networks and physics constraints.

problem Solving parametric differential equations with physics constraints.
method Combines Theory of Functional Connections and Physics-Informed Neural Networks with a single-layer Extreme Learning Machine.
result Achieves high accuracy with low computational time.

Study how past radiation determines present matter in Penrose's cyclic cosmology.

problem Determining matter content in the present eon from past radiation in Penrose's cyclic cosmology.
method Solve Einstein's equations for a spherical wave in the past eon, then apply reciprocity to find the present eon's matter content.
result The present eon is filled with three types of radiation: a damped wave, an in-going wave, and randomly scattered waves.

This paper explores the connection between adversarial and knowledge transferability.

problem Understanding the factors affecting knowledge transferability.
method Theoretical analysis and practical metrics for adversarial transferability.
result Adversarial transferability and knowledge transferability are closely related.

Study measures impact of data and neural net similarity on transferability in restaurant sales data.

problem Identify indicators for successful transferability of neural nets across different data sets.
method Empirical study on sales data from six restaurants, calculating indicators based on data and neural net similarities.
result Negative correlations between transferability and indicators, allowing better model performance and fewer transfers.

Adversarially robust models transfer better than standard models in image classification.

problem Improving transfer learning performance in image classification.
method Focused on adversarially robust ImageNet classifiers, compared to standard models.
result Adversarially robust models yield improved accuracy on downstream classification tasks.

Adaptive source selection for positive transfer in linear models improves target dataset performance.

problem Limited task-specific labeled data in business settings.
method Greedily decides from which sources and how many samples to incorporate into the target dataset using an accept/reject rule based on a data-dependent estimate of the transfer gain.
result Consistent gains over classical and recent strong baselines while avoiding negative transfer.

New framework explains fast transfer of hyperparameters across model scales.

problem Understanding and optimizing hyperparameters for large-scale models.
method Developed a conceptual framework for HP transfer across scale, showing fast transfer is equivalent to useful transfer for compute-optimal grid search.
result Fast transfer of hyperparameters is equivalent to useful transfer for compute-optimal grid search, offering asymptotic computational advantage.

The paper explores transferability of adversarial examples between convex and 01 loss models, finding non-transferability due to different decision boundaries caused by outliers.

problem Transferability of adversarial examples between convex and 01 loss models.
method Empirical study of transferability between linear 01 loss and convex (hinge) loss models, and between neural networks with different activation functions.
result Adversarial examples are non-transferable between convex and 01 loss models due to different decision boundaries caused by outliers.

New analysis shows transfer learning can significantly reduce sample size for complex models.

problem Reducing sample size needed for complex models like large language models.
method Optimal transport viewpoint applied to analyze transfer learning efficiency.
result Transfer learning can achieve better sample efficiency for complex models.

Unified view on GP transfer learning for Bayesian optimization.

problem Improving data efficiency in Bayesian optimization with scarce data.
method Unified hierarchical GP models for transfer learning, including a novel boosted GP transfer model.
result Unified analysis and comparison of transfer learning methods for GP models.

We extend graph neural networks to transfer performance across different input sizes.

problem Transferability of graph neural networks across varying input dimensions.
method Introduce a general framework for transferability across dimensions, showing it corresponds to continuity in a limit space.
result Transferability of graph neural networks is driven by data and learning task, and can be ensured with design principles.

Transfer learning improves model robustness against adversarial attacks.

problem Understanding how transfer learning affects model robustness against adversarial attacks.
method Extensive empirical evaluations of white-box and black-box attacks on fine-tuned transfer learning models.
result Adversarial examples are more transferable when fine-tuning is used than when networks are trained independently.

TX-Ray analyzes and quantifies model knowledge transfer in NLP.

problem Insufficient methods for explaining and quantifying model knowledge transfer in NLP.
method Modified computer vision explainability principle to NLP, visualizing feature preference distributions.
result TX-Ray reveals how self-supervised models learn linguistic abstractions and improves generalization.

Localized transfer learning improves nonparametric regression performance.

problem Improving nonparametric regression performance on target tasks.
method Localized transfer learning framework that models heterogeneity and partition covariate space into cells.
result Sharp minimax rates show local transfer mitigates the curse of dimensionality.

Enhances adversarial example transferability by fine-tuning existing examples.

problem Adversarial examples are often overfit to a source model, limiting black-box transferability.
method Intermediate Level Attack (ILA) fine-tunes adversarial examples on a pre-specified layer of the source model.
result ILAs achieve high transferability to target models without knowledge of their architecture.

A number of approaches to solving the well-known transfer pricing problem are known. However, few models satisfactorily resolve the core problem of allowing both the source and receiving divisions to earn a profit on transfers during a period in such a way that sub-optimal output levels are avoided. In 1969, Samuel pro…

2009-03-19abs ↗pdf ↗

Recent years, transfer learning has attracted much attention in the community of machine learning. In this paper, we mainly focus on the tasks of parameter transfer under the framework of extreme learning machine (ELM). Unlike the existing parameter transfer approaches, which incorporate the source model information in…

2018-09-04abs ↗pdf ↗

Transfer learning does not improve character recognition performance.

problem Improving character recognition performance using transfer learning.
method Performed experiments with varying levels of similarity between source and target tasks, transferring both parameters and features.
result No significant advantage gained by transfer learning over traditional machine learning.