Method leverages bid/ask curves to improve price distribution forecasts.
problem Inaccurate price forecasts in irregular market conditions.
method Error-dressing technique using published bid/ask information.
result Method outperforms standard distributional modeling.
We present a simple, yet realistic, agent-based model of an electricity market. The proposed model combines the spot and balancing markets with a resolution of one minute, which enables a more accurate depiction of the physical properties of the power grid. As a test, we compare the results obtained from our simulation…
Contracts for Difference (CfDs) are forwards on the spread between an area price and the system price. Together with the system price forwards, these products are used to hedge the area price risk in the Nordic electricity market. The CfDs are typically available for the next two months, three quarters and three years.…
The electricity market is a very peculiar market due to the large variety of phenomena that can affect the spot price. However, this market still shows many typical features of other speculative (commodity) markets like, for instance, data clustering and mean reversion. We apply the diffusion entropy analysis (DEA) to …
Study improves electricity price forecasting accuracy using a hybrid model.
problem Accurate short-term electricity price forecasting is challenging due to social and natural factors.
method Hybrid model combining GARMA, G-GARCH, Wavelet, LLWNN, and optimization algorithms.
result The hybrid model outperforms other models in Nord Pool Electricity markets.
Study predicts electricity prices using LSTM models with feature selection, considering market coupling.
problem Accurate day-ahead electricity price forecasting in coupled markets.
method Hybrid LSTM-based deep learning models with feature selection algorithms.
result Proposed models achieve considerably accurate results in Nordic market.
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.
Proposes α-integration pooling for CNNs to improve performance.
problem Finding optimal pooling method for CNNs is challenging.
method Introduces α-integration pooling with a trainable parameter α. result Demonstrates α-integration pooling outperforms other pooling methods in image recognition. A new spectral pooling method reduces loss in CNNs for better performance.
problem Lossy downsampling in CNNs reduces discriminability.
method Hartley Spectral Pooling using Hartley Transform.
result Hartley Spectral Pooling preserves more structure features than max/average pooling.
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.
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.
EdgePool improves GNN performance by pooling edges, not nodes.
problem Lack of effective graph pooling methods in GNNs.
method Edge contraction pooling approach.
result EdgePool outperforms alternative pooling methods.
We seek to improve deep neural networks by generalizing the pooling operations that play a central role in current architectures. We pursue a careful exploration of approaches to allow pooling to learn and to adapt to complex and variable patterns. The two primary directions lie in (1) learning a pooling function via (…
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.
An efficient algorithm identifies labels from sparse pooled data.
problem Identify unknown labels from condensed measurements of items.
method Design an efficient algorithm based on novel pooling scheme.
result Resolves statistical-to-computational gap in minimum pools needed.
Proposes clique pooling for graph classification.
problem Graph classification challenges.
method Clique-based graph pooling within GCN and GraphSAGE.
result Competitive performance on graph classification benchmarks.
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…
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.
Develops a novel global pooling framework using optimal transport.
problem Sub-optimal performance in global pooling operations.
method Regularized Optimal Transport (ROT) for generalized global pooling.
result ROTP layers can improve performance in various machine learning scenarios.
SAN replaces global pooling layers, improving accuracy and reducing overfitting.
problem Improving accuracy and reducing overfitting in deep neural networks.
method Introducing Set Aggregation Network (SAN) as a trainable global pooling layer.
result SAN improves classification accuracy and is less prone to overfitting.
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…
In this work we compute lower Lipschitz bounds of ℓp pooling operators for p=1,2,∞ as well as ℓ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…
The paper introduces a pooling mechanism for graph CNNs using NMF.
problem Pooling in graph structured data for efficient computation.
method Non-negative matrix factorization for node pooling.
result The pooling mechanism improves graph classification performance.
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.
A new method pools graph vertex representations into a function space for better graph classification.
problem Pooling graph vertex representations for graph-centric tasks.
method Proposes a novel function space pooling method for graph neural networks.
result The proposed method generally outperforms existing pooling methods in graph classification.
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.
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.
Graph neural network framework learns graph representations from node features and local structures.
problem Lack of hierarchical pooling to preserve graph structure in graph neural networks.
method Introduces a pooling operator based on graph Fourier transform to combine node features and local structures.
result Framework $\m$ improves graph classification performance on 6 benchmarks.
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.
A new graph pooling method using self-attention improves graph classification performance.
problem Challenges in applying downsampling to graphs in graph neural networks.
method Proposes a self-attention-based graph pooling method.
result Our method achieves superior graph classification performance on benchmark datasets.
Improved vehicle classification using ResNets and spatial pooling.
problem Fine-grained vehicle classification using ResNet architectures.
method Training ResNet-18, -34, and -50 on Comprehensive Cars dataset. Adding Spatially Weighted Pooling and localisation.
result Combining Spatially Weighted Pooling and localisation increases top-1 accuracy to 96.351%.
Paper tackles liquidation in dark pools with adverse selection, proving uniqueness of solution.
problem Liquidation in dark pools with adverse selection for multi-asset portfolios.
method Analyzes a multidimensional stochastic control problem leading to a matrix-valued BSDE with jumps and singular terminal condition.
result Proves uniqueness of solution, novel even in simplified settings.
SpaPool combines dense and sparse techniques for efficient graph pooling.
problem Efficiently processing large graphs in graph neural networks.
method Adaptive clustering of graph vertices into clusters.
result SpaPool outperforms existing methods on small-scale graphs.
Graph pooling method uses GNN to cluster graphs efficiently.
problem Efficiently cluster graphs for graph pooling.
method Formulates a continuous relaxation of minCUT, trains GNN to minimize it.
result GNN-based clustering learns fast and performs well.
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.
We propose a max-pooling based loss function for training Long Short-Term Memory (LSTM) networks for small-footprint keyword spotting (KWS), with low CPU, memory, and latency requirements. The max-pooling loss training can be further guided by initializing with a cross-entropy loss trained network. A posterior smoothin…
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.
Proposes an online pool generation method for DCS to improve classifier selection accuracy.
problem Difficulty in selecting competent classifiers in dynamic classifier selection techniques.
method Online local pool generation method that considers classification difficulty of samples.
result Significantly greater recognition rates compared to other pool generation methods.
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…
We introduce a simple and effective method for regularizing large convolutional neural networks. We replace the conventional deterministic pooling operations with a stochastic procedure, randomly picking the activation within each pooling region according to a multinomial distribution, given by the activities within th…
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…
Person Re-Identification (person re-id) is a crucial task as its applications in visual surveillance and human-computer interaction. In this work, we present a novel joint Spatial and Temporal Attention Pooling Network (ASTPN) for video-based person re-identification, which enables the feature extractor to be aware of …