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

Trend · papers per month

22456789 · May 202619922001200920172026
48 results for logarithmic pooling

Algorithm learns expert weights to minimize regret in adversarial setting.

problem Learning to aggregate expert forecasts with no-regret guarantee in adversarial conditions.
method Online mirror descent algorithm for logarithmic pooling of expert forecasts.
result Achieves O(TlogT)O(\sqrt{T} \log T) expected regret compared to best weights.

No fair and strategy-proof automated market maker exists for more than two assets.

problem Designing a fair and strategy-proof automated market maker for multiple assets.
method Analyzing the weighted-product family of aggregation rules and their properties.
result No aggregation rule is both fair and strategy-proof for more than two assets.

Domain generalization is the problem of assigning labels to an unlabeled data set, given several similar data sets for which labels have been provided. Despite considerable interest in this problem over the last decade, there has been no theoretical analysis in the setting of multi-class classification. In this work, w…

2019-05-24abs ↗pdf ↗

Improved likelihood-free inference by localizing and refining low-dimensional approximations.

problem Poor performance of common likelihood-free methods in high-dimensional models.
method Localisation followed by refinement of low-dimensional summaries.
result Improved accuracy in marginal posteriors through localized and refined approximations.

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 ↗

Methods from convex optimization are widely used as building blocks for deep learning algorithms. However, the reasons for their empirical success are unclear, since modern convolutional networks (convnets), incorporating rectifier units and max-pooling, are neither smooth nor convex. Standard guarantees therefore do n…

2016-04-07abs ↗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.

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.

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 ↗

Greedy MI maximization method outperforms existing approaches in nonlinear models.

problem Maximizing mutual information in nonlinear models with non-Gaussian noise.
method Greedy approaches based on log-Sobolev inequalities for computationally inexpensive MI lower bounds.
result Proposed method outperforms random selection and Gaussian approximations.

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 ↗

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 ↗

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.

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.

In order to improve forecasts, a decisionmaker often combines probabilities given by various sources, such as human experts and machine learning classifiers. When few training data are available, aggregation can be improved by incorporating prior knowledge about the event being forecasted and about salient properties o…

2012-07-11abs ↗pdf ↗

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 ↗

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.

Graph Neural Networks (GNNs), which generalize deep neural networks to graph-structured data, have drawn considerable attention and achieved state-of-the-art performance in numerous graph related tasks. However, existing GNN models mainly focus on designing graph convolution operations. The graph pooling (or downsampli…

2019-11-14abs ↗pdf ↗

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.

We consider a finite-horizon market-making problem faced by a dark pool that executes incoming buy and sell orders. The arrival flow of such orders is assumed to be random and, for each transaction, the dark pool earns a per-share commission no greater than the half bid-ask spread. Throughout the entire period, the mai…

2015-02-10abs ↗pdf ↗

Convolutional layers in graph neural networks are a fundamental type of layer which output a representation or embedding of each graph vertex. The representation typically encodes information about the vertex in question and its neighbourhood. If one wishes to perform a graph centric task, such as graph classification,…

2019-05-15abs ↗pdf ↗

Sound event detection (SED) methods are tasked with labeling segments of audio recordings by the presence of active sound sources. SED is typically posed as a supervised machine learning problem, requiring strong annotations for the presence or absence of each sound source at every time instant within the recording. Ho…

2018-04-26abs ↗pdf ↗

Various types of structures that enable a group of individuals to pool their mortality risk have been proposed in the literature. Collectively, the structures are called pooled annuity funds. Since the pooled annuity funds propose different methods of pooling mortality risk, we investigate the connections between them …

2013-11-20abs ↗pdf ↗