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.

169,051 papers · 148 categories

Trend · papers per month

144287431574 · Jun 202019922001200920182026
48 results for assembly efficiency

Machine learning speeds up the construction of virus assembly fitness landscapes.

problem Constructing realistic evolutionary fitness landscapes for viruses is computationally expensive.
method Developed a neural network to model virus assembly efficiency from a whole genome/phenotype space.
result Machine learning significantly reduces the computational time for constructing fitness landscapes.

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.

BEAN models neuronal correlations to create interpretable representations.

problem Hard interpretation of dense-layer representations in DNNs.
method Inspired by neuroscience, BEAN models neuronal correlations and dependencies.
result BEAN enables formation of interpretable neuronal clusters without sacrificing model performance.

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 ↗

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 ↗

Semi-supervised deep learning detects problematic reads for genome assembly.

problem De novo genome assembly is hindered by specific types of reads.
method Analysis of coverage graphs converted to 1D-signals using semi-supervised deep learning models.
result Semi-supervised deep learning models can detect problematic reads with minimal labeled 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.

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.

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 ↗

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.

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 ↗

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 ↗

Cardea automates machine learning for EHRs, improving model building efficiency.

problem Lack of a trusted, open-source framework for automated machine learning in EHRs.
method Uses FHIR for data structure, AUTOML frameworks for feature engineering, model selection, and tuning, and an adaptive data assembler.
result Demonstrates framework's effectiveness on 5 prediction tasks, highlighting its flexibility and human competitiveness.

New proof of index theorem for topological manifold bundles.

problem Index theorem for fiber bundles of compact topological manifolds.
method Use of a convenient framework for bivariant theories and recent results on the homotopy type of the topological cobordism category.
result Refinement of the assembly map for an extended A-theory characteristic.

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 ↗

We prove that the Farrell-Jones assembly map for connective algebraic K-theory is rationally injective, under mild homological finiteness conditions on the group and assuming that a weak version of the Leopoldt-Schneider conjecture holds for cyclotomic fields. This generalizes a result of Bökstedt, Hsiang, and Madsen, …

2015-04-14abs ↗pdf ↗

This paper studies how modular agents can learn to control complex morphologies.

problem Contemporary sensorimotor learning starts with existing complex agents, but this paper explores learning from primitive, modular agents.
method A collection of primitive agents learns to dynamically self-assemble into composite bodies and coordinate their behavior to control these bodies.
result Dynamic and modular agents demonstrate better generalization to test-time changes in both environment and agent structure.

This paper presents a method to efficiently estimate rare event probabilities using a combination of high and low-fidelity models.

problem Estimating the probability of failure for complex systems using high-fidelity models is expensive and inaccurate for rare events.
method The paper introduces a multi-fidelity surrogate modeling strategy using active learning and subset simulation to merge high and low-fidelity models.
result The method significantly reduces computational cost while maintaining high accuracy in estimating rare event probabilities.

Paper proposes neural networks for automatically naming assembly functions.

problem Automatically assigning names to assembly code functions.
method Formal definition of problem, baseline models (Seq2Seq, Transformer), fine-tuning neural networks.
result Neural networks can effectively predict function names in binaries, even outperforming state-of-the-art.

Study uses multi-agent reinforcement learning to control self-assembly with high-resolution external control.

problem Designing effective external control protocols for self-assembly with high-resolution control.
method Investigated a multi-agent reinforcement learning approach, comparing fully decentralized and partially decentralized strategies.
result Partially decentralized approach outperforms fully decentralized in controlling self-assembly towards target structures.

Let M be a hyperkähler manifold. The S^2-family of complex structures compatible with the hyperkähler metric can be assembled into a single complex structure on Z=MxS^2; the resulting complex manifold is known as the twistor space of M. We describe the analogous construction for generalized complex structures in the se…

2013-09-18abs ↗pdf ↗

CHANI learns classification tasks with local transformations inspired by biology.

problem Proving neural networks can learn classification tasks with local transformations.
method CHANI uses spiking neurons modeled by Hawkes processes with expert aggregation for local learning.
result CHANI can learn and encode multiple classes, forming assemblies of neurons.

Optimal design portfolios improve energy efficiency and reduce risk in uncertain reservoirs.

problem Uncertain reservoir conditions lead to unstable gas recovery and low resource efficiency.
method Developed optimal portfolios of well designs based on reservoir conditions and probabilities.
result Remarkable reduction in variation and substantial increase in energy efficiency achieved.

A geometric model for twisted KK-homology is introduced. It is modeled after the Mathai-Melrose-Singer fractional analytic index theorem in the same way as the Baum-Douglas model of KK-homology was modeled after the Atiyah-Singer index theorem. A natural transformation from twisted geometric KK-homology to the new g…

2012-11-07abs ↗pdf ↗

Study geometry of tetrahedra in complex hyperbolic space and Hilbert spaces.

problem Understanding geometric relationships between complex hyperbolic spaces and Hilbert spaces.
method Use a complex analog of the cosine of a vertex angle as a novel technical tool.
result Describe possible triangular faces of tetrahedra in hyperbolic space and three-dimensional subspaces in Hilbert spaces with Pick kernels.

This paper explores topological aspects of index theory for infinite-dimensional manifolds.

problem Formulating index theory for infinite-dimensional manifolds with LT-actions.
method Introducing RKK-theory and constructing assembly maps for proper LT-spaces.
result Formulation of infinite-dimensional Poincaré duality and assembly maps.

We employ the sl(2) foam cohomology to define a cohomology theory for oriented framed tangles whose components are labelled by irreducible representations of U_q(sl(2)). We show that the corresponding colored invariants of tangles can be assembled into invariants of bigger tangles. For the case of knots and links, the …

2012-07-13abs ↗pdf ↗

Trained SPENs with efficient search in reward function for structured prediction.

problem Expensive ground-truth labeling in structured output prediction.
method Efficient truncated randomized search in reward function for training SPENs.
result Local improvements and effective supervision for SPENs without labeled data.

In this paper, the second of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs has girth tending to infinity, then the maximal coarse Baum-Connes assembly map is an isomorphism for the associated metric space XX. As discussed in the first paper in this s…

2010-12-19abs ↗pdf ↗

This paper is a systematic approach to the construction of coronas (i.e. Higson dominated boundaries at infinity) of combable spaces. We introduce three additional properties for combings: properness, coherence and expandingness. Properness is the condition under which our construction of the corona works. Under the as…

2017-11-18abs ↗pdf ↗

The weak regular coherence is a coarse property of a finitely generated group ΓΓ. It was introduced by G. Carlsson and this author to play the role of a weakening of Waldhausen's regular coherence as part of computation of the integral K-theoretic assembly map. A new class of metric spaces (sFDC) was introduced recent…

2013-07-19abs ↗pdf ↗

We study the hairy graph homology of a cyclic operad; in particular we show how to assemble corresponding hairy graph cohomology classes to form cocycles for ordinary graph homology, as defined by Kontsevich. We identify the part of hairy graph homology coming from graphs with cyclic fundamental group as the dihedral h…

2013-08-18abs ↗pdf ↗