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

Trend · papers per month

87173260346 · Jun 202019922001200920172026
48 results for granular representation

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.

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.

Paper proposes a classifier using fuzzy sets for data simplification.

problem Data simplification and handling uncertainty in real-world applications.
method Multi-resolution hierarchical granular representation (MRHGRC) using hyperbox fuzzy sets.
result High accuracy at low granularity with reduced data size.

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.

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.

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 proposes PRR network for better experience reuse in reinforcement learning.

problem Efficient experience reuse in reinforcement learning across multiple granularities.
method Proposes PRR network trained on multi-level architecture to extract and store experience.
result PRR network leads to better experience reuse and improved performance.

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.

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.

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.

Paper tackles overestimation bias in continuous control, improving performance by 25%.

problem Overestimation bias in off-policy learning.
method Truncated Quantile Critics (TQC) combines distributional representation, truncation, and ensembling of critics.
result TQC outperforms state-of-the-art methods by 25% on the Humanoid environment.

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 gg) as a proxy for liquidity. This leads to a Price Impact Surface which depends on both volume ωω and gg. The dependence …

2009-02-24abs ↗pdf ↗

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.

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…

2018-09-04abs ↗pdf ↗

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.

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.

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.

OMBA learns product and user representations for better online market basket analysis.

problem Limited ability to uncover rarely occurring and temporal associations in MBA.
method Jointly learns product and user representations, captures temporal dynamics, scalable online method.
result OMBA outperforms state-of-the-art methods by 21% on real-world 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.

In information retrieval, a fundamental goal is to transform a document into concepts that are representative of its content. The term "representative" is in itself challenging to define, and various tasks require different granularities of concepts. In this paper, we aim to model concepts that are sparse over the voca…

2012-04-11abs ↗pdf ↗

Paper offers guidelines for using ML in cyber security, focusing on botnet detection.

problem Lack of public benchmark datasets for evaluating ML-based cyber security systems.
method Provided concrete guidelines and recommendations for using supervised ML in cyber security, focusing on botnet detection.
result Ensemble models are well-suited to handle class imbalance in botnet detection.

We discuss an autoencoder model in which the encoding and decoding functions are implemented by decision trees. We use the soft decision tree where internal nodes realize soft multivariate splits given by a gating function and the overall output is the average of all leaves weighted by the gating values on their path. …

2014-09-26abs ↗pdf ↗

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.

Interpretable representations improve explainable AI by translating complex data into understandable concepts.

problem Many explainers use interpretable representations but overlook their full potential and assumptions.
method An in-depth analysis of interpretable representations for tabular, image, and text data, identifying strengths, weaknesses, and desiderata.
result Linear model quantifies interpretable concepts' influence on black-box predictions, revealing their explanatory properties and manipulability.

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.