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.

169,051 papers · 148 categories

Trend · papers per month

4998146195 · Jun 202019922001200920172026
48 results for Gaussian pyramid

A novel approach for augmenting histopathological images by blending Gaussian-Laplacian pyramids.

problem Data imbalance and inter-patient variability in histopathological images.
method Image blending using Gaussian-Laplacian pyramids to distribute inter-patient variability.
result Promising gains in performance compared to existing data augmentation techniques.

The paper analyzes Laplacian pyramids for extending and denoising discrete functions.

problem Analyzing conditions for convergence and stability of Laplacian pyramids.
method Investigates Laplacian pyramids for extension and denoising, providing convergence conditions and stability bounds.
result Mild conditions are provided under which the Laplacian pyramids algorithm converges and stability bounds are proven.

Pyramid Attention Networks improve image restoration by leveraging self-similarities across scales.

problem Lack of full exploitation of self-similarities in image restoration by recent deep learning methods.
method Introduces a Pyramid Attention module that processes multi-scale feature correspondences to borrow clean signals from coarser levels.
result Pyramid Attention module achieves state-of-the-art results in various image restoration tasks.

Single wide layer followed by a pyramidal structure ensures global convergence in deep networks.

problem Ensuring global convergence in deep neural networks with limited width constraints.
method Proves that a single wide layer followed by a pyramidal structure guarantees global convergence for over-parameterized networks.
result Single wide layer of width NN suffices for global convergence in deep networks with constant-width remaining layers.

Reduced CNN complexity for exoplanet detection without significant loss in accuracy.

problem Reducing the number of parameters in CNNs for time-series data.
method Two methods for complexity reduction in AstroNet: tactical reduction of layers and modification of input data.
result Non-substantial loss in accuracy with up to 85% reduction in training time.

By formulating N = 1, 2, 4, 8, D = 3, Yang-Mills with a single Lagrangian and single set of transformation rules, but with fields valued respectively in R,C,H,O, it was recently shown that tensoring left and right multiplets yields a Freudenthal-Rosenfeld-Tits magic square of D = 3 supergravities. This was subsequently…

2013-12-23abs ↗pdf ↗

Improves speaker verification for variable-duration utterances using a feature pyramid module.

problem Improving robustness for variable-duration utterances in speaker verification.
method Integrates a feature pyramid module into multi-scale aggregation to enhance speaker-discriminative information from multiple layers.
result Improves performance for both short and long utterances compared to state-of-the-art approaches.

PyFi uses adversarial agents to train VLMs on financial image understanding.

problem Training VLMs to understand complex financial questions.
method PyFi-600K dataset and adversarial MCTS mechanism.
result Fine-tuned VLMs improve by 19.52% and 8.06% on financial question accuracy.

SPF uses a hierarchical approach to efficiently emulate climate changes.

problem Slow and unstable climate emulation for long horizons.
method Spatiotemporal Pyramid Flows (SPF) model data hierarchically across spatial and temporal scales.
result SPF outperforms flow matching baselines and pre-trained models on ClimateBench.

Enhances neural networks' robustness against adversarial samples without sacrificing clean sample generalization.

problem Limited generalization and time complexity of adversarial training.
method Feature Pyramid Decoder (FPD) framework that integrates denoising and image restoration modules into CNNs and constrains the Lipschitz constant.
result FPD-enhanced CNNs achieve sufficient robustness against general adversarial samples on various datasets.

Deep neural network detects changepoints at multiple scales in multivariate time series.

problem Detecting gradual and abrupt changes in multivariate time series data.
method Proposed a pyramid recurrent neural network (PRN) for multi-scale changepoint detection.
result PRN outperforms state-of-the-art methods in detecting changepoints at multiple scales.

We introduce a wavelet-domain functional analysis of variance (fANOVA) method based on a Bayesian hierarchical model. The factor effects are modeled through a spike-and-slab mixture at each location-scale combination along with a normal-inverse-Gamma (NIG) conjugate setup for the coefficients and errors. A graphical mo…

2016-02-12abs ↗pdf ↗

This paper focuses on a class of linear Hawkes processes with general immigrants. These are counting processes with shot noise intensity, including self-excited and externally excited patterns. For such processes, we introduce the concept of age pyramid which evolves according to immigration and births. The virtue if t…

2015-04-24abs ↗pdf ↗

Biological neural network mimics CCA for multi-channel data.

problem Implementing CCA in a biologically plausible neural network.
method Derive an online CCA algorithm with local synaptic updates for multi-compartmental neurons.
result The derived neural network architecture and synaptic updates resemble cortical pyramidal neuron behavior.

The challenge of object categorization in images is largely due to arbitrary translations and scales of the foreground objects. To attack this difficulty, we propose a new approach called collaborative receptive field learning to extract specific receptive fields (RF's) or regions from multiple images, and the selected…

2014-02-02abs ↗pdf ↗

Advances conditions for neural networks to learn connected decision regions.

problem Conditions for neural networks to learn connected decision regions.
method Developed sufficient and necessary conditions for connected decision regions using a wider class of activation functions.
result Proven neural networks with pyramidal structure and certain activation functions produce connected decision regions.

Non-linear dimensionality reduction techniques such as manifold learning algorithms have become a common way for processing and analyzing high-dimensional patterns that often have attached a target that corresponds to the value of an unknown function. Their application to new points consists in two steps: first, embedd…

2013-11-26abs ↗pdf ↗

A deep learning framework assesses physical rehabilitation exercises.

problem Lack of versatile, robust, and practical assessment methods for rehabilitation exercises.
method Deep learning framework with metrics, scoring functions, and neural networks.
result First implementation of deep neural networks for rehabilitation performance assessment.

We construct a global homeomorphism from any 3D Ricci limit space to a smooth manifold, that is locally bi-Holder. This extends the recent work of Miles Simon and the second author, and we build upon their techniques. A key step in our proof is the construction of local "pyramid Ricci flows", existing on uniform region…

2018-03-01abs ↗pdf ↗

The predictions of the S&P 500 returns made in 2007 have been tested and the underlying models amended. The period between 2003 and 2008 should be described by the dependence of the S&P 500 stock market index on real GDP because the population pyramid was highly inaccurate. The 2008 trough and 2009 rally are well predi…

2010-03-29abs ↗pdf ↗

Develops LSTM for predicting neuronal dynamics over long time-horizons.

problem Understanding and controlling complex brain behaviors.
method Long Short-Term Memory (LSTM) neural network architecture for multi-time step predictions.
result LSTM improves short time-horizon prediction accuracy and multi-time step predictions of neuronal dynamics.

ADAVI tackles variational inference for large HBM models in neuroimaging.

problem Large, pyramidally-organized HBM models in neuroimaging studies.
method Automatic dual amortized variational inference using neural networks and attention-based hierarchical encoding.
result Significantly reduced parameterization of the variational family, maintaining expressivity.

While the optimization problem behind deep neural networks is highly non-convex, it is frequently observed in practice that training deep networks seems possible without getting stuck in suboptimal points. It has been argued that this is the case as all local minima are close to being globally optimal. We show that thi…

2017-04-26abs ↗pdf ↗

MRCNet tackles crowd counting and density mapping in aerial imagery.

problem Accurate crowd counting and density estimation in aerial imagery.
method MRCNet is a novel encoder-decoder CNN that combines VGG-16 with FPN-inspired lateral connections.
result MRCNet outperforms state-of-the-art methods in aerial and CCTV-based crowd counting.

We present a machine learning-based approach to lossy image compression which outperforms all existing codecs, while running in real-time. Our algorithm typically produces files 2.5 times smaller than JPEG and JPEG 2000, 2 times smaller than WebP, and 1.7 times smaller than BPG on datasets of generic images across all …

2017-05-16abs ↗pdf ↗

Reflective of income and wealth distributions, philanthropic gifting appears to follow an approximate power-law size distribution as measured by the size of gifts received by individual institutions. We explore the ecology of gifting by analysing data sets of individual gifts for a diverse group of institutions dedicat…

2013-07-08abs ↗pdf ↗

DefogGAN predicts hidden RTS game information to aid strategic decision-making.

problem Predicting hidden information in real-time strategy games like StarCraft.
method Conditional Generative Adversarial Network (GAN) with pyramidal reconstruction loss.
result DefogGAN predicts enemy buildings and combat units as accurately as professional players.

The signed volume function for polyhedra can be generalized to a mean volume function for volume elements by averaging over the triangulations of the underlying polyhedron. If we consider these up to translation and scaling, the resulting quotient space is diffeomorphic to a sphere. The mean volume function restricted …

2013-02-25abs ↗pdf ↗