Higher granularity in MoE models boosts expressivity exponentially.
problem Expressivity of Mixture-of-Experts models with varying granularity.
method Comparing models with different numbers of active experts (granularity).
result Exponential separation in network expressivity based on granularity.
Chaos in cerebellar cells enhances complexity of neural patterns.
problem Understanding how cerebellar granular layer represents complex information.
method Constructed a model of cerebellar granular layer with gap junctions, evaluated using reservoir computing.
result Chaotic dynamics in the cerebellar granular layer produce complex and diverse output patterns.
GACAN combines multi-granularity time series for traffic forecasting.
problem High dynamics and complex spatial-temporal dependency of road networks in traffic forecasting.
method Graph Attention-Convolution-Attention Networks (GACAN) with Att-Conv-Att (ACA) block.
result GACAN outperforms state-of-the-art baselines in traffic forecasting.
Study identifies key brain regions and model architectures for ASD diagnosis.
problem Subjective and time-consuming ASD diagnosis by clinicians.
method Comparative analysis of model architectures and atlas granularities.
result High-performing models use 2-4 hidden layers and 16-64 neurons per layer, and cerebellum is predictive of ASD.
Network analysis reveals distinct financial relationships among Euro Area banks.
problem Understanding complex interbank relationships in the Euro Area.
method Multi-layer network approach using granular financial data.
result A more complete picture of the Euro Area interbank market topology.
Employs granular data to create a multilayer network for euro area banks, revealing distinct risk patterns.
problem Lack of comprehensive, granular data integration for systemic risk assessment in euro area banks.
method Constructs an empirically grounded multilayer network integrating various supervisory and statistical datasets, each layer representing a distinct transmission channel.
result Cross-layer heterogeneity in connectivity and centrality reveals economically relevant structure and misidentifies systemically important institutions.
Since the 2007-2009 financial crisis, substantial academic effort has been dedicated to improving our understanding of interbank lending networks (ILNs). Because of data limitations or by choice, the literature largely lacks multiple loan maturities. We employ a complete interbank loan contract dataset to investigate w…
Neural HMM with AGA captures multi-scale dynamics in financial markets.
problem Capturing multi-scale temporal dynamics in financial markets.
method Parallel multi-resolution encoders, adaptive gating, and multi-head attention.
result Outperforms fixed-resolution baselines in predicting price movements and liquidity shocks.
SGQuant reduces GNN memory usage without significant accuracy loss.
problem High memory consumption in GNNs limits their applicability on memory-constrained devices.
method Proposes a specialized GNN quantization scheme (SGQuant) with a quantization algorithm, fine-tuning scheme, and multi-granularity strategy.
result SGQuant reduces GNN memory footprint from 4.25x to 31.9x with minimal accuracy loss.
GBOC detects anomalies in time series data using granular-ball vectors.
problem Challenges in modeling normal behavior in dynamic, nonlinear time series data.
method Granular-ball Vector Data Description (GVDD) and Granular-ball One-Class Network (GBOC).
result GBOC improves anomaly detection in time series data.
We explore the use of graph networks to deal with irregular-geometry detectors in the context of particle reconstruction. Thanks to their representation-learning capabilities, graph networks can exploit the full detector granularity, while natively managing the event sparsity and arbitrarily complex detector geometries…
Unsupervised deep learning detects image quality issues without annotations.
problem Anomaly detection in images with quality issues.
method Use of deep generative models, specifically normalizing flows, for anomaly detection.
result Accurate semantic labeling and quality trends observed in images.
New method detects anomalies in computing centers' logs.
problem Anomaly detection in continuously changing log data for predictive maintenance.
method Evolving granular classifiers using Fuzzy-set-Based evolving Modeling and evolving Granular Neural Network.
result Classification model prioritizes maintenance based on anomaly severity.
Machine learning uncovers hidden correlations in granular material behavior.
problem Predicting mechanical behavior of granular materials from particle size distributions.
method Used Discrete Element Method to generate packings, trained artificial Neural Network.
result Artificial Neural Network revealed hidden correlations between particle size distributions and mechanical behavior.
We introduce a microscopic model for the dynamics of the order book to study how the lack of liquidity influences price fluctuations. We use the average density of the stored orders (granularity g) as a proxy for liquidity. This leads to a Price Impact Surface which depends on both volume ω and g. The dependence …
INGB improves oversampling for noisy imbalanced datasets.
problem Imbalanced, noisy, and complex datasets in classification problems.
method INGB uses granular balls to simulate spatial distribution and informed entropy for optimization, followed by nonlinear oversampling.
result INGB outperforms traditional linear sampling frameworks and algorithms on complex datasets.
We propose a probabilistic model for refining coarse-grained spatial data by utilizing auxiliary spatial data sets. Existing methods require that the spatial granularities of the auxiliary data sets are the same as the desired granularity of target data. The proposed model can effectively make use of auxiliary data set…
Revisits granular models explaining firm growth rates and sizes.
problem Understanding the relationship between firm size and growth rate statistics.
method Developed new theoretical insights linking firm size and growth rate statistics within granular models.
result Growth volatility distribution is size-independent but fat-tailed, challenging granular models.
We introduce a hierarchical architecture for video understanding that exploits the structure of real world actions by capturing targets at different levels of granularity. We design the model such that it first learns simpler coarse-grained tasks, and then moves on to learn more fine-grained targets. The model is train…
Graph Neural Networks model 3D granular flow simulations.
problem Accurate modeling of complex 3D granular flow processes.
method Graph Neural Networks approach to simulate 3D granular flow using LIGGGHTS.
result Machine learning trajectories match physical granular flow processes.
New method predicts bankruptcy by imputing missing data with granular semantics.
problem Missing data, high dimensional data, and class imbalance in bankruptcy prediction.
method Granular computing for missing data imputation with feature semantics and AI-driven pipeline.
result Efficient solution for big datasets with high imputation rates.
Motivated by the practical demands for simplification of data towards being consistent with human thinking and problem solving as well as tolerance of uncertainty, information granules are becoming important entities in data processing at different levels of data abstraction. This paper proposes a method to construct c…
Tree++ graph kernel captures similarities at multiple granularities.
problem Lack of scale-adaptivity in existing graph kernels.
method Tree++ uses truncated BFS trees and super paths to represent graphs at different granularities.
result Tree++ achieves best classification accuracy on real-world graphs.
Study uses trajectory embedding to measure place function similarity at fine spatial granularity.
problem Measuring place function similarity at fine spatial granularity.
method Trajectory embedding to reduce dimensions and measure similarity of place functions.
result Embedding similarity can be a metric proxy for place functions at fine spatial granularity.
The clustering ensemble technique aims to combine multiple clusterings into a probably better and more robust clustering and has been receiving an increasing attention in recent years. There are mainly two aspects of limitations in the existing clustering ensemble approaches. Firstly, many approaches lack the ability t…
Paper tackles cross-granularity few-shot learning with meta-embedder.
problem Few-shot learning with coarse labels and fine-grained testing.
method Meta-embedder that optimizes visual and semantic discrimination across coarse and fine classes.
result Meta-embedder achieves effective cross-granularity few-shot classification.
Develops MgCSL for discovering causal structures in high-dimensional data.
problem Discovering causal relationships from high-dimensional data with complex interplay of variables.
method MgCSL uses sparse auto-encoders for coarse-graining and multi-layer perceptrons for detailed analysis, introducing simplified acyclicity constraints.
result MgCSL outperforms existing methods and finds explainable causal connections in fMRI datasets.
New method learns fusion rules from few images using granular ball priors.
problem Challenges in supervised learning for image fusion with limited data.
method Introduces incomplete priors and Granular Ball Pixel Computation (GBPC) algorithm.
result Lightweight neural network learns effective fusion rules from few images.
Reducing ICD-10 code granularity improves cost model accuracy and stability.
problem High-dimensional regression with ICD-10 codes leads to unstable coefficient estimates.
method Log-linear analytics approach to cost model regularization through diagnostic code merging.
result Reducing ICD-10 code granularity from 7 characters to 6 or fewer improves model interpretability and consistency.
Reduces high granularity and dimensionality in hierarchical categorical variables.
problem Overfitting and estimation issues in predictive models due to high granularity and dimensionality.
method Entity embedding and top-down clustering algorithm to reduce granularity and dimensionality.
result The reduced hierarchy improves model fit and complexity balance.
Paper tackles sparse, unstructured data tensors by optimizing adaptive aggregation granularity.
problem Sparse, unstructured data tensors are hard to analyze.
method Introduces IceBreaker, a greedy algorithm that optimizes adaptive tensor aggregation.
result IceBreaker constructs tensors with high structure quality from various datasets.
Proposes element-level differential privacy for better privacy and utility in statistical learning.
problem Challenges of strong differential privacy in statistical learning applications.
method Introduces element-level differential privacy, extending classical DP to protect specific user elements.
result Provides better utility and more robust results compared to classical DP by allowing finer privacy protections.
The paper develops a method to discover causal relations and predict material laws with uncertainty quantification.
problem Discovering causal relations and predicting material laws with uncertainty in civil engineering applications.
method The paper develops a causal discovery algorithm to infer causal relations among time-history data. It uses a deep neural network with dropout layers for uncertainty quantification and propagates predictions through a causal graph.
result The method accurately predicts material laws and quantifies uncertainty, as demonstrated in two numerical examples.
Nested learning improves model performance on multi-granular tasks.
problem Overconfident models and lack of fine-grained confidence in predictions.
method Introducing nested learning with a sequence of nested feature embeddings and explicit combination of outputs.
result Nested learning outperforms standard end-to-end training on various datasets.
Fuzzy eIX method evolves classifiers for online data streams.
problem Handling time-varying classifiers in online data streams.
method Develops evolving Internal-eXternal Fuzzy granules for numerical data.
result Fuzzy eIX maintains high accuracy in dynamic scenarios.
IGSD separates task-specific content channels in transformer components by comparing activation replacement with zero ablation.
problem Mechanistic interpretability of transformer components
method IGSD: paired-intervention framework for comparing activation replacement with zero ablation
result IGSD identifies an early-layer content channel in transformer components that standard importance methods underestimate.
BitPruning learns optimal bitlengths for neural networks to balance accuracy and efficiency.
problem Finding the minimum bitlength for neural network accuracy.
method A training method that penalizes large bitlengths and minimizes other quantifiable criteria.
result The method learns efficient representations while maintaining accuracy, reducing bitlengths by 3.76 bits on average per layer.
A method uses Wasserstein clustering to simplify financial data analysis.
problem Processing and analyzing granular financial data with missing values and identifying clusters.
method Variant of Lloyd's algorithm applied to probability distributions, using Wasserstein barycenters.
result Demonstrated usefulness in financial regulation context.
Even in the simple one-factor credit portfolio model that underlies the Basel II regulatory capital rules coming into force in 2007, the exact contributions to credit value-at-risk can only be calculated with Monte-Carlo simulation or with approximation algorithms that often involve numerical integration. As this may r…
BGNNs model particle-boundary interactions efficiently.
problem Efficiently modeling geometric boundaries in 3D simulations.
method Introduce Boundary Graph Neural Networks (BGNNs) to dynamically modify graph structures.
result BGNNs accurately reproduce 3D granular flows without handcrafted conditions.
The paper proposes a principle for dynamically adjusting the granularity of reinforcement learning abstractions.
problem Lack of general principles for dynamically adjusting the granularity of reinforcement learning abstractions.
method The paper proposes a principle based on rate-distortion theory, formalized through a performance certificate decomposing value error into learning and abstraction error bounds.
result Soft state-action abstractions can achieve near-optimal performance under substantial lossy compression of state and action information.
Big spatio-temporal datasets, available through both open and administrative data sources, offer significant potential for social science research. The magnitude of the data allows for increased resolution and analysis at individual level. While there are recent advances in forecasting techniques for highly granular te…
Gradient descent biases neural networks to use an average of features, leading to non-robustness.
problem Non-robustness in neural networks due to feature averaging.
method Theoretical analysis and experiments on binary classification tasks.
result Gradient descent trains networks to rely on an average of features, making them vulnerable to adversarial attacks.
Investment tool predicts higher returns for Madrid real estate units.
problem Determining which real estate units have higher returns to investment in Madrid.
method Data collection from Idealista.com, descriptive statistics, return index, machine learning algorithms.
result Introduction of machine learning algorithms for rental real estate price prediction.
New modularity function improves clustering of spatially embedded networks.
problem Improving clustering in spatially embedded networks for unsupervised learning.
method Developed a new modularity function and compared its performance with existing methods.
result Our modularity function outperforms existing methods in partitioning 2D and 3D granular assemblies.
Conventional hardware-friendly quantization methods, such as fixed-point or integer, tend to perform poorly at very low word sizes as their shrinking dynamic ranges cannot adequately capture the wide data distributions commonly seen in sequence transduction models. We present AdaptivFloat, a floating-point inspired num…
WaveQ uses sinusoidal regularization to optimize deep quantization for neural networks, improving both efficiency and accuracy.
problem Deep quantization reduces bitwidth but can lead to significant accuracy loss due to inter-layer dependencies.
method WaveQ employs sinusoidal regularization to learn multiple quantization parameters during gradient-based training, balancing compute efficiency and accuracy.
result WaveQ achieves accuracy preservation and efficiency gains across various deep networks, outperforming state-of-the-art techniques.
Adaptive prediction timing improves healthcare outcomes by predicting patient events at the right frequency.
problem Inconsistent prediction granularity in healthcare models.
method Introduces a novel approach using Bayesian recurrent models and a new aggregation method to adapt prediction frequency based on uncertainty.
result Adaptive prediction timing leads to improved predictive performance, especially in the critical first 12 hours of patient stay.