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,742 papers · 148 categories

Trend · papers per month

285785113 · May 202619922001200920172026
48 results for residual pooling

An emerging design principle in deep learning is that each layer of a deep artificial neural network should be able to easily express the identity transformation. This idea not only motivated various normalization techniques, such as \emph{batch normalization}, but was also key to the immense success of \emph{residual …

2016-11-14abs ↗pdf ↗

We reduce training time in convolutional networks (CNNs) with a method that, for some of the mini-batches: a) scales down the resolution of input images via downsampling, and b) reduces the forward pass operations via pooling on the convolution filters. Training is performed in an interleaved fashion; some batches unde…

2019-10-15abs ↗pdf ↗

The paper introduces a diagnostic method to detect grokking transitions in models before test accuracy improves.

problem Detecting the transition from training to generalization in machine learning models.
method Summarize task-dependent observables as empirical distributions, map them to Wasserstein/quantile coordinates, and analyze using Hankel dynamic mode decomposition.
result The diagnostic method achieves AUROC \(\approx\) 0.93 for grokking-vs-non-grokking discrimination at the run level.

MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution.

problem Understanding the coarse-graining procedure in MLP residual networks
method Analyzing a pure MLP residual stack on synthetic Markov chain sequences
result MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution

CSP improves time-series forecasting without training, outperforming DeepNPTS in speed and accuracy.

problem Improving probabilistic time-series forecasting without training.
method Mixing empirical and residual draws around a seasonal naive forecast.
result CSP significantly outperforms DeepNPTS on CRPS, normalized mean quantile loss, and coverage metrics.

Convolutional neural networks (CNNs) have achieved remarkable performance in many applications, especially in image recognition tasks. As a crucial component of CNNs, sub-sampling plays an important role for efficient training or invariance property, and max-pooling and arithmetic average-pooling are commonly used sub-…

2018-11-08abs ↗pdf ↗

Global catastrophe risk pools increase financial resilience by diversifying risk and including more countries.

problem Low- to middle-income countries rely heavily on foreign aid for recovery from extreme weather events, which is slow and uncertain.
method Developed a method to form global catastrophe risk pools that maximize risk diversification and select countries with low bilateral correlations or low shares in the pool risk.
result Global pooling increases risk diversification, lowers countries' shares in the pool risk, and increases the number of countries benefiting from risk pooling.

In most convolution neural networks (CNNs), downsampling hidden layers is adopted for increasing computation efficiency and the receptive field size. Such operation is commonly so-called pooling. Maximation and averaging over sliding windows (max/average pooling), and plain downsampling in the form of strided convoluti…

2018-10-07abs ↗pdf ↗

New image classifier uses hierarchical max-pooling with local pooling.

problem Improving image classification accuracy with variable spatial relationships.
method Introduces a hierarchical max-pooling model with additional local pooling for convolutional neural networks.
result Demonstrates improved performance in estimating image features.

Convolutional Neural Networks (CNNs) have been recently introduced in the domain of session-based next item recommendation. An ordered collection of past items the user has interacted with in a session (or sequence) are embedded into a 2-dimensional latent matrix, and treated as an image. The convolution and pooling op…

2018-08-15abs ↗pdf ↗

Optimizes diversification in catastrophe risk pooling using asymptotic analysis.

problem Maximizing diversification benefit from catastrophic events in insurance pools.
method Asymptotic analysis to solve high-dimensional optimization problem.
result Derives an asymptotically optimal pool that approximates practical optimal pool.

We decompose the squared price-of-risk premium into three components: intervention-stable premium, confounding wedge, and information loss.

problem Decomposing the squared price-of-risk premium into its components
method Identifying an order-three obstruction to aggregation across portfolios
result The decomposition is estimable and detectable with a permutation-calibrated screen

This paper investigates the impact of dark pools on price discovery (the efficiency of prices on stock exchanges to aggregate information). Assets are traded in either an exchange or a dark pool, with the dark pool offering better prices but lower execution rates. Informed traders receive noisy and heterogeneous signal…

2016-12-27abs ↗pdf ↗

This research simplifies lending pools in decentralized finance for better understanding and security.

problem Complexity and lack of executable models make lending pools hard to understand and predict.
method Developed a formal model to reflect common features of lending pools and proved general properties.
result Proved correct handling of funds and described vulnerabilities and attacks.

Graph Neural Network (GNN) research has concentrated on improving convolutional layers, with little attention paid to developing graph pooling layers. Yet pooling layers can enable GNNs to reason over abstracted groups of nodes instead of single nodes. To close this gap, we propose a graph pooling layer relying on the …

2019-05-27abs ↗pdf ↗

New regularizer improves neural network robustness and generalization.

problem Ineffective weight decay for networks with homogeneous activation functions.
method Proposes an invariant regularizer to penalize intrinsic weight norms.
result Improves generalization and adversarial robustness on various datasets.

We consider interactive algorithms in the pool-based setting, and in the stream-based setting. Interactive algorithms observe suggested elements (representing actions or queries), and interactively select some of them and receive responses. Pool-based algorithms can select elements at any order, while stream-based algo…

2016-02-02abs ↗pdf ↗

In this work we compute lower Lipschitz bounds of p\ell_p pooling operators for p=1,2,p=1, 2, \infty as well as p\ell_p pooling operators preceded by half-rectification layers. These give sufficient conditions for the design of invertible neural network layers. Numerical experiments on MNIST and image patches confirm tha…

2013-11-16abs ↗pdf ↗

ASAP improves graph pooling for hierarchical graph representations.

problem Pooling in graphs fails to effectively capture substructure or scale to large graphs.
method ASAP uses self-attention and modified GNN to capture node importance and learn sparse soft cluster assignments.
result Combining ASAP with GNN architectures leads to state-of-the-art results on graph classification benchmarks.

We propose a novel graph pooling operation using cliques as the unit pool. As this approach is purely topological, rather than featural, it is more readily interpretable, a better analogue to image coarsening than filtering or pruning techniques, and entirely nonparametric. The operation is implemented within graph con…

2019-03-31abs ↗pdf ↗

HGP-SL pools and learns graph structure for hierarchical representation learning.

problem Graph pooling is overlooked in GNN models, limiting hierarchical representation learning.
method Integrates graph pooling and structure learning into a unified module.
result HGP-SL improves graph classification performance on benchmarks.

Proposes a graph pooling method leveraging node proximity for hierarchical graph representation learning.

problem Efficiently exploiting the geometry of graph data for hierarchical representation learning.
method Combines node proximity with kernel representation of topology and node features for adaptive node signal similarities evaluation.
result Achieves state-of-the-art performance on graph classification benchmark datasets.

TL-ANDI distills context from source data to improve transfer learning for TFMs.

problem Limited transfer learning due to context-size constraints and distribution shifts.
method TL-ANDI uses posterior-aware distillation to construct a compact source context and locally distills labels.
result Improves transfer performance by addressing context-size and distribution shifts.

EarnMore uses masked stock representations to train RL agents for customizable stock pools efficiently.

problem Training RL agents for customizable stock pools (CSPs) is computationally expensive and unstable.
method EarnMore introduces a mechanism to mask out stocks outside the target pool, learns meaningful stock representations, and uses a re-weighting mechanism to focus on favorable stocks.
result EarnMore significantly outperforms state-of-the-art baselines in profit metrics with over 40% improvement.

Global pooling, such as max- or sum-pooling, is one of the key ingredients in deep neural networks used for processing images, texts, graphs and other types of structured data. Based on the recent DeepSets architecture proposed by Zaheer et al. (NIPS 2017), we introduce a Set Aggregation Network (SAN) as an alternative…

2018-10-03abs ↗pdf ↗

Graph neural networks, which generalize deep neural network models to graph structured data, have attracted increasing attention in recent years. They usually learn node representations by transforming, propagating and aggregating node features and have been proven to improve the performance of many graph related tasks…

2019-04-30abs ↗pdf ↗

We explore the application of end-to-end stateless temporal modeling to small-footprint keyword spotting as opposed to recurrent networks that model long-term temporal dependencies using internal states. We propose a model inspired by the recent success of dilated convolutions in sequence modeling applications, allowin…

2018-11-19abs ↗pdf ↗

Study characterizes Uniswap v3 liquidity pools using transaction graphs and identifies ideal trading conditions.

problem Computational expense in analyzing the full Uniswap v3 ecosystem.
method Extracted and analyzed a sub-universe of liquidity pools, using transaction graphs and graph2vec algorithm.
result Identified seven clusters of liquidity takers with similar trading preferences and introduced an ideal crypto law.

Optimal rebalancing strategy improves AMM pool performance by 25%.

problem Optimizing the sequence of weights in dynamic AMM pools to minimize rebalancing costs.
method Using optimal interpolation and a cheap-to-compute approximation to achieve nearly optimal rebalancing.
result Approximately-optimal weight changes lead to significant increases in pool performance (up to 25%) under various conditions.

High-fee pools attract more liquidity but execute less volume; low-fee pools have more stable LPs.

problem Optimal liquidity supply and execution on decentralized exchanges with fixed gas costs.
method Analysis of Uniswap data to compare high- and low-fee pools.
result Fragmented liquidity leads to more LPs and competition, improving overall market efficiency.

Study optimal liquidation strategies in lit and dark pools with and without regulation.

problem Optimal liquidation strategies in dark and lit pools with execution uncertainty.
method Design optimal make-take fee policies, solve HJB-Fokker-Planck systems, use BSDEs.
result Explicit solutions for optimal strategies in both competitive and regulated markets.

Dual model predicts electricity spot prices using neural networks and wavelets.

problem Forecasting hourly electricity spot prices.
method Dual generalized long memory modelling with k-factor GARMA and G-GARCH models, using LLWNN and PSO for variance prediction.
result The hybrid k-factor GARMA-LLWNN model outperforms other methods in forecasting accuracy.

Improved forecasting of investment dynamics across heterogeneous panels using a two-stage model.

problem Forecasting investment dynamics in heterogeneous panels with varying dynamics.
method Two-stage architecture: global pooled AR(1) for shared persistence, local models for residual dynamics.
result Significant improvement in out-of-sample R2R^2 from 0.630 to 0.677, with a gain of 0.047.

This research improves capital efficiency and impermanent loss in cryptocurrency markets using multi-token trading pools.

problem Poor impermanent loss and capital efficiency in automated market makers.
method Analysis and construction of a multi-token token proactive market maker (MPMM).
result MPMM shows better impermanent loss and capital efficiency than comparable market makers.

Study on pooled annuity funds and how initial savings affect income stability.

problem Analyzing the stability of income payments in pooled annuity funds.
method Examining the influence of initial savings on income fluctuations and developing a criterion for pooling funds.
result Identification of a term, the 'implied number of homogeneous members', linking initial savings to income fluctuations.

Proposes SimPool for graph pooling using structural similarity features.

problem Challenges in graph pooling due to lack of spatial locality.
method Integrates structural similarity features with a revised pooling layer to propose SimPool.
result SimPool produces node cluster assignments resembling CNN's locality preserving pooling.

Paper proposes a new method for more accurate group testing of infected patients.

problem Identifying infected patients efficiently with reduced tests and corrected errors.
method Adaptive design of pools based on Bayesian posterior prediction using belief propagation algorithm.
result The proposed method results in more accurate identification of infected patients.

Recently, with convolutional neural networks gaining significant achievements in many challenging machine learning fields, hand-crafted neural networks no longer satisfy our requirements as designing a network will cost a lot, and automatically generating architectures has attracted increasingly more attention and focu…

2018-10-31abs ↗pdf ↗