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

Trend · papers per month

481115 · Dec 201919922001200920172026
48 results for granular assemblies

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.

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.

For every strong coarse homology theory we construct a coarse assembly map as a natural transformation between coarse homology theories. We provide various conditions implying that this assembly map is an equivalence. These results generalize known results for the analytic coarse assembly map for K-homology to general …

2017-06-07abs ↗pdf ↗

Model predicts composite structures assembly quality with input uncertainty.

problem Accurate prediction of dimensional deviations and residual stress in composite structures assembly.
method Neural Network Gaussian Process considering input uncertainty.
result NNGPIU model outperforms other methods for nonsmooth, nonlinear responses.

If a Lie algebra structures $\gG$ on a vector space is the sum of a family of mutually compatible Lie algebra structures $\gG_i$, we say that $\gG$ is \emph{simply assembled} from $\gG_s$'s. By repeating this procedure several times one gets a family of Lie algebras \emph{assembled} from $\gG_s$'s. The central result o…

2012-05-28abs ↗pdf ↗

We construct the geometric Baum-Connes assembly map for twisted Lie groupoids, that means for Lie groupoids together with a given groupoid equivariant PU(H)PU(H)-principle bundle. The construction is based on the use of geometric deformation groupoids, these objects allow in particular to give a geometric construction of …

2014-02-14abs ↗pdf ↗

We study in this paper the maximal version of the coarse Baum-Connes assembly map for families of expanding graphs arising from residually finite groups. Unlike for the usual Roe algebra, we show that this assembly map is closely related to the (maximal) Baum-Connes assembly map for the group and is an isomorphism for …

2009-02-13abs ↗pdf ↗

Realistic evolutionary fitness landscapes are notoriously difficult to construct. A recent cutting-edge model of virus assembly consists of a dodecahedral capsid with 1212 corresponding packaging signals in three affinity bands. This whole genome/phenotype space consisting of 3123^{12} genomes has been explored via comp…

2019-01-13abs ↗pdf ↗

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.

Controlled KK-theory is used to show that algebraic KK-theory of virtually abelian groups is described by an assembly map defined using possibly-infinite hyperelementary subgroups. The Farrell-Jones summand (coming from infinite subgroups) is parameterized by the rational projective space of the group, and a reduced …

2005-09-13abs ↗pdf ↗

If a Lie algebra structure g on a vector space is the sum of a family of mutually compatible Lie algebra structures g_i's, we say that g is simply assembled from the g_i's. Repeating this procedure with a number of Lie algebras, themselves simply assembled from the g_i's, one obtains a Lie algebra assembled in two step…

2017-07-14abs ↗pdf ↗

We use assembly maps to study TC(A[G];p)\mathbf{TC}(\mathbb{A}[G];p), the topological cyclic homology at a prime pp of the group algebra of a discrete group GG with coefficients in a connective ring spectrum A\mathbb{A}. For any finite group, we prove that the assembly map for the family of cyclic subgroups is an isomorphis…

2016-07-13abs ↗pdf ↗

In this article, we introduce the notion of a functor on coarse spaces being coarsely excisive- a coarse analogue of the notion of a functor on topological spaces being excisive. Further, taking cones, a coarsely excisive functor yields a topologically excisive functor, and for coarse topological spaces there is an ass…

2010-02-24abs ↗pdf ↗

Defines and computes geometric pairings for discrete groups using Baum-Connes assembly map.

problem Defining and computing geometric pairings for discrete countable groups.
method Constructs explicit morphisms and the Chern-Baum-Connes assembly map.
result Explicit formulation of a Chern-Connes pairing with the periodic cyclic cohomology of the group algebra.

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.

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.

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.

We construct a higher Whitehead torsion map, using algebraic K-theory of spaces, and show that it satisfies the usual properties of the classical Whitehead torsion. This is used to describe a "geometric assembly map" defined on stabilized structure spaces in purely homotopy theoretic terms.

2011-05-11abs ↗pdf ↗

Model detects patterns in noisy binary data, explaining neuron activity in terms of cell assemblies.

problem Detecting structure in noisy or approximate repeats of patterns in sparse binary data.
method Probabilistic binary latent variable model based on Noisy-OR model, inferring sparse activity in latent variables.
result Model successfully extracts and explains latent structure in spiking neural data.

In this paper, we propose a semi-supervised deep learning method for detecting the specific types of reads that impede the de novo genome assembly process. Instead of dealing directly with sequenced reads, we analyze their coverage graphs converted to 1D-signals. We noticed that specific signal patterns occur in each r…

2019-04-23abs ↗pdf ↗

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.

In this paper we introduce a homotopy theoretic technique for proving that the KK-theoretic assembly map is an equivalence. It is an extension of the methods used to prove split injectivity of the assembly and applies to any geometrically finite group. Our result is that there are two requirements which need to hold. …

2013-05-15abs ↗pdf ↗

Bayesian calibration for BCP self-assembly models using image data and measure transport.

problem Calibrating models of BCP self-assembly from image data with aleatory uncertainty.
method Likelihood-free inference via measure transport and summary statistics.
result Expected information gains can be computed efficiently for model calibration.

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.

Between the category of exact metric spaces with bounded geometry (about which much is known) and the larger category of arbitrary exact metric spaces (about which little is known) lies the intermediate category of asymptotically exact metric spaces. We show that the coarse Baum-Connes assembly map is naturally split s…

2012-06-13abs ↗pdf ↗

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.

In this paper, the first of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs is an expander and the girth of the graphs tends to infinity, then the coarse Baum-Connes assembly map is injective, but not surjective, for the associated metric space XX. Exp…

2010-12-19abs ↗pdf ↗

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.

This paper provides a full controlled version of algebraic KK-theory. This includes a rich array of assembly maps; the controlled assembly isomorphism theorem identifying the controlled group with homology; and the stability theorem describing the behavior of the inverse limit as the control parameter goes to 0. There…

2004-02-24abs ↗pdf ↗

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.