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

2457 · Jun 201919922001200920172026
48 results for concatenation

New technique stabilizes singular values in concatenated matrices.

problem How singular values of concatenated matrices relate to individual components.
method Developed perturbation technique extending classical results to concatenated matrices.
result Dominant singular values remain stable under small perturbations in submatrices.

i-DenseNets improve parameter efficiency and performance in density estimation.

problem Improving parameter efficiency and performance in density estimation models.
method Invertible Dense Networks (i-DenseNets) with learnable weighted concatenation and Concatenated LipSwish activation function.
result i-DenseNets outperform Residual Flows and other flow-based models in bits per dimension.

Multi-view clustering is a learning paradigm based on multi-view data. Since statistic properties of different views are diverse, even incompatible, few approaches implement multi-view clustering based on the concatenated features straightforward. However, feature concatenation is a natural way to combine multi-view da…

2019-01-30abs ↗pdf ↗

Enhanced ODT with Feature Concatenation boosts learning efficiency.

problem Insufficient learning efficiency of ODT due to linear projections not being transmitted to child nodes.
method Feature Concatenation ( exttt{FC-ODT}) to transmit linear projections along decision paths.
result Experiments show exttt{FC-ODT} outperforms state-of-the-art decision trees with a limited tree depth.

The paper computes a knot's Kauffman bracket polynomial using recursive concatenation of a 4-tangle shadow.

problem Computing the Kauffman bracket polynomial for complex knots.
method Recursive concatenation of a 4-tangle shadow, followed by a closure operation and polynomial computation.
result A method to compute the Kauffman bracket polynomial for knots formed from 4-tangle shadows.

Speech-driven facial animation involves using a speech signal to generate realistic videos of talking faces. Recent deep learning approaches to facial synthesis rely on extracting low-dimensional representations and concatenating them, followed by a decoding step of the concatenated vector. This accounts for only first…

2019-12-12abs ↗pdf ↗

The GANs are generative models whose random samples realistically reflect natural images. It also can generate samples with specific attributes by concatenating a condition vector into the input, yet research on this field is not well studied. We propose novel methods of conditioning generative adversarial networks (GA…

2016-11-04abs ↗pdf ↗

Paper introduces multi-scale methods to improve CATE estimation from EO data.

problem Challenges in balancing fine-grained and contextual information in EO-based causal inference.
method Multi-Scale Representation Concatenation, combining Vision Transformer and Causal Forests.
result Multi-scale approach captures effect heterogeneity better than single-scale models.

There are a multitude of methods to perform multi-set correlated component analysis (MCCA), including some that require iterative solutions. The methods differ on the criterion they optimize and the constraints placed on the solutions. This note focuses perhaps on the simplest version, which can be solved in a single s…

2018-02-11abs ↗pdf ↗

This paper extends the construction of invariants for virtual knots to virtual long knots and introduces two new invariant modules of virtual long knots. Several interesting features are described that distinguish virtual long knots from their classical counterparts with respect to their symmetries and the concatenatio…

2007-05-31abs ↗pdf ↗

Here we give a concrete description of the cork automorphism f:WWf:\partial W\to \partial W of the infinite order loose-cork (W,f)(W,f), defined in \cite{a2}. It is obtained by concatenating the defining ribbon disk of WW in B4B^4 by an infinite order isotopy of the boundary knot.

2020-01-09abs ↗pdf ↗

We introduce a dynamical-systems approach for the study of the Sard problem in sub-Riemannian Carnot groups. We show that singular curves can be obtained by concatenating trajectories of suitable dynamical systems. As an applications, we positively answer the Sard problem in some classes of Carnot groups.

2019-08-29abs ↗pdf ↗

We prove that for any compact orientable connected 3-manifold with torus boundary, a concatenation of it and the direct product of the circle and the Klein bottle with an open 2-disk removed admits a Lagrangian embedding into the standard symplectic 6-space. Moreover, minimal Maslov number of the Lagrangian embedding i…

2019-02-14abs ↗pdf ↗

The paper quantizes concatenated noisy vectors to a common cluster center, improving performance over naive methods.

problem Clustering concatenated noisy vectors from multiple sources.
method Asymptotic analysis of weighted sum of distances to a common cluster center.
result The clustering approach outperforms naive methods in terms of average distortion.

Deep Transformed Gaussian Processes extend TGPs with variational inference for scalable multi-layer modeling.

problem Flexible modeling of complex data distributions.
method DTGPs are a multi-layer model of TGPs using variational inference for scalability.
result DTGPs achieve good scalability and performance in multiple regression datasets.

Recently, deep reinforcement learning (RL) methods have been applied successfully to multi-agent scenarios. Typically, these methods rely on a concatenation of agent states to represent the information content required for decentralized decision making. However, concatenation scales poorly to swarm systems with a large…

2018-07-17abs ↗pdf ↗

We compute the Kauffman bracket polynomial of the three-lead Turk's head, the chain sinnet and the figure-eight chain shadow diagrams. Each of these knots can in fact be constructed by repeatedly concatenating the same 3-tangle, respectively, then taking the closure. The bracket is then evaluated by expressing the stat…

2018-07-13abs ↗pdf ↗

We present a method for fast resting-state fMRI spatial decomposi-tions of very large datasets, based on the reduction of the temporal dimension before applying dictionary learning on concatenated individual records from groups of subjects. Introducing a measure of correspondence between spatial decompositions of rest …

2016-02-08abs ↗pdf ↗

In this paper we demonstrate that performance of a speaker verification system can be improved by concatenating electroencephalography (EEG) signal features with speech signal features or only using EEG signal features. We use state-of-the-art end-to-end deep learning model for performing speaker verification and we de…

2019-06-17abs ↗pdf ↗

This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as possible. An explanation based on that is given for a previously investigated colla…

2010-02-18abs ↗pdf ↗

A coordinate-free proof of the Maximum Principle is provided in the specific case of an optimal control problem with fixed time. Our treatment heavily relies on a special notion of variation of curves that consist of a concatenation of integral curves of time-dependent vector fields with unit time component, and on the…

2002-12-04abs ↗pdf ↗

We discuss theoretical aspects of the product rule for classification problems in supervised machine learning for the case of combining classifiers. We show that (1) the product rule arises from the MAP classifier supposing equivalent priors and conditional independence given a class; (2) under some conditions, the pro…

2013-01-17abs ↗pdf ↗

The paper is divided in 2 parts. The first part is the original paper of the second and third authors arXiv:1202.5442v2. The second part is an erratum/addendum written in english and concatenated at the end of the former paper. In the erratum/addentum, we amend Theorems 1.3 and 1.11 of arXiv:1202.5442v2: Finitude géomé…

2012-02-24abs ↗pdf ↗

There is growing interest in multi-label image classification due to its critical role in web-based image analytics-based applications, such as large-scale image retrieval and browsing. Matrix completion has recently been introduced as a method for transductive (semi-supervised) multi-label classification, and has seve…

2019-04-08abs ↗pdf ↗

Better neural arithmetic logic units improve cell counting model generalization.

problem Neural networks struggle with high cell counts outside training data range.
method Introduced Neural Arithmetic Logic Units (NALU) for arithmetic operations in existing architectures.
result Improved cell counting accuracy for higher numeric ranges with better generalization.

New polynomial invariants defined for long virtual knots.

problem Defining and studying polynomial invariants for long virtual knots.
method Intersection numbers of cycles on a closed surface, considering crossing order.
result Intersection polynomials are finite-type invariants of degree two under crossing changes, but not under virtualizations.

The paper extends a knot invariant to graphs and connects it to homology cylinders.

problem Understanding the structure of homology cobordism groups.
method Using tangle Floer homology, the authors define a new invariant for embedded graphs and prove a concatenation formula.
result The new invariant induces a homomorphism on the homology cobordism group of homology cylinders.

We consider braids on m+nm+n strands, such that the first mm strands are trivially fixed. We denote the set of all such braids by Bm,nB_{m,n}. Via concatenation Bm,nB_{m,n} acquires a group structure. The objective of this paper is to find a presentation for Bm,nB_{m,n} using the structure of its corresponding pure braid sub…

2000-08-31abs ↗pdf ↗

GOCPD detects change points by maximizing the probability of two independent models.

problem Large false discovery rates in online change point detection methods.
method GOCPD uses ternary search to find change points by maximizing the probability of two independent models.
result GOCPD accelerates CPD with logarithmic complexity for single change point detection.