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 α-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. 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.
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.
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.
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.
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 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…
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.
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.
Pooling data across users improves prediction of context occurrences in mobile health interventions.
problem Diffusing treatment delivery over times when a user is in a desired context.
method Investigated several methods to pool data across users to overcome individual-level data limitations.
result Pooling data lowers overall error rate compared to personalized and batch approaches.
Paper uses CNN to predict process parameters from molten pool data in WLAM.
problem Achieving high quality in WLAM through real-time process control.
method Proposes a multi-modality CNN architecture to predict process parameters from molten pool sensor data.
result Improved prediction performance of multi-modal CNN compared to uni-modal approach.
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.
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.
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.
New 3D protein analysis methods improve accuracy.
problem Lack of suitable learning algorithms for protein data.
method Intrinsic-Extrinsic Convolution and Pooling for 3D protein structures.
result Outperforms state-of-the-art methods on protein analysis tasks.
Paper presents efficient algorithms for reconstructing noisy pooled data.
problem Reconstructing hidden states from noisy pooled data.
method Simple and efficient distributed algorithms for two noise models.
result Our algorithms reconstruct exact initial states with high probability.
New method pools graphs with edge features for molecular data.
problem Pooling graphs with edge features for molecular data.
method Proposes two types of pooling layers compatible with edge-feature graph-convolutional architecture.
result Significantly outperforms previous benchmarks on three out of four MoleculeNet datasets.
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.
This paper addresses clustering with missing data using Rubin's rules.
problem How to pool partitions and assess instability when data are incomplete after multiple imputation.
method Consensus clustering and bootstrap theory are used to address the problem.
result New rules for pooling partitions and assessing instability are proposed and validated.
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.
Optimal fees for CFMMs prevent liquidity pools from competing to the bottom.
problem Maximizing liquidity provider returns in CFMMs with multiple pools.
method Theoretical and numerical analysis of Nash equilibria for optimal fees.
result Pure Nash equilibria of optimal fees exist for CFMMs using Uniswap's trade function.
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.
The paper tackles fast rates in batch active learning with pool-based data.
problem Reduced adaptivity in batch active learning leads to suboptimal results.
method Proposes a stage-wise greedy algorithm that balances informativeness and diversity.
result The algorithm's excess risk matches minimax rates in standard statistical learning settings.
Max-pooling architectures are theoretically analyzed and shown to be globally optimized and generalize well.
problem Theoretical understanding and optimization of max-pooling in deep learning architectures.
method Theoretical analysis of a convolutional max-pooling architecture, focusing on a pattern detection problem.
result Max-pooling architectures can be globally optimized and generalize well, even for highly over-parameterized models.
LaPool improves molecular graph representation learning by capturing interaction importance.
problem Lack of efficient intermediate pooling steps in GNNs leads to poor molecular substructure representation.
method LaPool is a novel, data-driven, and interpretable hierarchical graph pooling method that considers node features and graph structure.
result LaPool outperforms recent GNNs on molecular graph prediction and understanding tasks.
Bayesian framework for federated learning of neural networks without data pooling.
problem Scattered data across servers in federated learning problems.
method Bayesian nonparametric framework for neural networks, inference approach.
result Synthesize a more expressive global network with a single communication round.
iPool selects informative nodes for pooling in arbitrary graphs.
problem Pooling in graph neural networks is often overlooked.
method iPool uses a criterion based on neighborhood conditional entropy to select nodes for pooling.
result iPool achieves state-of-the-art performance on graph classification tasks.
MPVAA learns holistic patient representations from mixed healthcare data.
problem Learning personalized patient representations from heterogeneous healthcare data.
method Mixed Pooling Multi-View Attention Autoencoder (MPVAA) that integrates non-linear relationships among multiple data modalities.
result MPVAA generates more effective patient representations than state-of-the-art methods.
Many studies in biomedical and health sciences involve small sample sizes due to logistic or financial constraints. Often, identifying weak (but scientifically interesting) associations between a set of predictors and a response necessitates pooling datasets from multiple diverse labs or groups. While there is a rich l…
In this paper, we study the pooled data problem of identifying the labels associated with a large collection of items, based on a sequence of pooled tests revealing the counts of each label within the pool. In the noiseless setting, we identify an exact asymptotic threshold on the required number of tests with optimal …
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.
New method pools labels from similar data items to improve learning from small samples.
problem Learning from small, human-annotated samples with potential disagreement among annotators.
method Proposes neighborhood-based pooling for sharing labels across similar data items.
result Improves learning from small, noisy samples by pooling labels from similar items.
Framework predicts melt pool geometry with AI, improving manufacturing quality.
problem Achieving consistent product quality in Metal Additive Manufacturing.
method Surprise-guided sequential learning framework integrating CTGAN for limited data.
result Enhanced predictive accuracy for melt pool dimensions.
Moment Pooling reduces latent space dimensions in machine learning models.
problem High-dimensional latent spaces in machine learning models are hard to interpret.
method Moment Pooling extends Deep Sets networks to arbitrary multivariate moments.
result Latent dimensions as small as 1 can achieve similar performance to higher dimensions.
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 (…
In this paper we outline initial concepts for an immune inspired algorithm to evaluate price time series data. The proposed solution evolves a short term pool of trackers dynamically through a process of proliferation and mutation, with each member attempting to map to trends in price movements. Successful trackers fee…
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.
Efficiently combines probabilistic predictions using kernel embeddings.
problem Combining multiple probabilistic predictions to improve forecast accuracy.
method Embed predictions into RKHS, optimizes kernel-based scoring rules, finds efficient implementation.
result Generalised linear pool outperforms traditional linear pool in operational wind speed forecasts.
Backtesting framework for CLMMs on Uniswap V3 reduces reward estimation error.
problem Estimating rewards for CLMMs in Uniswap V3 liquidity pools.
method Parametric model for liquidity distribution, historical data analysis.
result Error in reward estimation less than 1% for each pool.
PR-GNN identifies salient brain regions for ASD biomarkers.
problem Identifying brain regions associated with neurological disorders.
method Pooling Regularized Graph Neural Network (PR-GNN) with novel salient region selection.
result PR-GNN outperforms baseline methods in ASD classification accuracy.
Dynamic Classifier Selection (DCS) techniques have difficulty in selecting the most competent classifier in a pool, even when its presence is assured. Since the DCS techniques rely only on local data to estimate a classifier's competence, the manner in which the pool is generated could affect the choice of the best cla…
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…
Modeling DEX liquidity with heterogeneous LPs and MEV bots.
problem Understanding and predicting the dynamics of decentralized cryptocurrency exchanges.
method Mean-field game approach to model liquidity providers' optimal strategies and interactions.
result Calibrated model produces consistent pool exchange rate dynamics and liquidity evolution.