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.
Transformers learn to recall with non-orthogonal embeddings in realistic settings.
New algorithms learn sparse set functions in non-orthogonal Fourier bases.
The Shapley value theory is used for risk allocation in non-orthogonal risk factors.
The study finds resonance points in polarised curves with polynomial conserved quantities.
Paper optimizes tensor deflation for non-orthogonal signals.
This paper investigates the use of multiple directions of stratification as a variance reduction technique for Monte Carlo simulations of path-dependent options driven by Gaussian vectors. The precision of the method depends on the choice of the directions of stratification and the allocation rule within each strata. S…
Paper improves feature selection accuracy using transfer learning.
The paper tackles learning symmetries in data without expert knowledge.
We introduce a novel harmonic analysis for functions defined on the vertices of a strongly connected directed graph of which the random walk operator is the cornerstone. As a first step, we consider the set of eigenvectors of the random walk operator as a non-orthogonal Fourier-type basis for functions over directed gr…
Non-orthogonal joint diagonalization (NJD) free of prewhitening has been widely studied in the context of blind source separation (BSS) and array signal processing, etc. However, NJD is used to retrieve the jointly diagonalizable structure for a single set of target matrices which are mostly formulized with a single da…
Multi-head attention mechanism is capable of learning various representations from sequential data while paying attention to different subsequences, e.g., word-pieces or syllables in a spoken word. From the subsequences, it retrieves richer information than a single-head attention which only summarizes the whole sequen…
Paper proposes a method to recover point configurations from noisy distance data.
Revisits CP tensor decomposition for noisy, non-orthogonal data.
Scheduling and power allocation improve federated learning efficiency in NOMA networks.
A new method reduces bootstrap simulation cost and improves accuracy.
Tensor factorization arises in many machine learning applications, such knowledge base modeling and parameter estimation in latent variable models. However, numerical methods for tensor factorization have not reached the level of maturity of matrix factorization methods. In this paper, we propose a new method for CP te…
The study classifies and constructs examples of surfaces with specific curvature and boundary conditions.
Spatial separation of suspended particles based on contrast in their physical or chemical properties forms the basis of various biological assays performed on lab-on-achip devices. To electronically acquire this information, we have recently introduced a microfluidic sensing platform, called Microfluidic CODES, which c…
We introduce three novel semi-parametric extensions of probabilistic canonical correlation analysis with identifiability guarantees. We consider moment matching techniques for estimation in these models. For that, by drawing explicit links between the new models and a discrete version of independent component analysis …
In this paper, we provide local and global convergence guarantees for recovering CP (Candecomp/Parafac) tensor decomposition. The main step of the proposed algorithm is a simple alternating rank- update which is the alternating version of the tensor power iteration adapted for asymmetric tensors. Local convergence g…
New algorithms improve machine learning performance with explicit regret bounds.
Develops a new framework for temporal anchoring in deep embedding spaces.
We study the distribution of the adaptive LASSO estimator (Zou (2006)) in finite samples as well as in the large-sample limit. The large-sample distributions are derived both for the case where the adaptive LASSO estimator is tuned to perform conservative model selection as well as for the case where the tuning results…
Superposition in autoencoders leads to loss in simple models.
Gradient descent dynamics in quadratic regression models are analyzed, revealing five phases: monotonic, catapult, periodic, chaotic, and divergent.
Sparse code multiple access (SCMA) has been one of non-orthogonal multiple access (NOMA) schemes aiming to support high spectral efficiency and ubiquitous access requirements for 5G wireless communication networks. Conventional SCMA approaches are confronting remarkable challenges in designing low complexity high accur…
Quantum mechanics fundamentally forbids deterministic discrimination of quantum states and processes. However, the ability to optimally distinguish various classes of quantum data is an important primitive in quantum information science. In this work, we train near-term quantum circuits to classify data represented by …
The Dynamic Mode Decomposition (DMD) extracted dynamic modes are the non-orthogonal eigenvectors of the matrix that best approximates the one-step temporal evolution of the multivariate samples. In the context of dynamical system analysis, the extracted dynamic modes are a generalization of global stability modes. We a…
A novel dictionary-based approach for predicting functions.
The BPS decomposition theorem splits cohomology of symmetric stacks into invariant parts.
Supporting ultra-reliable low-latency communications (URLLC) is a major challenge of 5G wireless networks. Stringent delay and reliability requirements need to be satisfied for both scheduled and non-scheduled URLLC traffic to enable a diverse set of 5G applications. Although physical and media access control layer sol…
Automated method finds meaningful directions in neural network activations.
A new method uses machine learning to optimize user pairing and association in multicell NOMA networks.
A new method predicts electron density accurately from atom-centered models.
Echo state network (ESN) is viewed as a temporal non-orthogonal expansion with pseudo-random parameters. Such expansions naturally give rise to regressors of various relevance to a teacher output. We illustrate that often only a certain amount of the generated echo-regressors effectively explain the variance of the tea…
GPU-accelerates multiuser detection for 5G URLLC systems.
New algorithms solve tensor problems with random components using SDP.
New method trains neural networks in spectral domain for improved performance.
New algorithms improve tensor CP decomposition under mild conditions.
In future cell-free (or cell-less) wireless networks, a large number of devices in a geographical area will be served simultaneously in non-orthogonal multiple access scenarios by a large number of distributed access points (APs), which coordinate with a centralized processing pool. For such a centralized cell-free net…
Study extends geodesic ray transform results to orientable surfaces.
Spectral learning extends matrix methods to tensors for better latent variable modeling.
We analyze Darboux transformations in very general settings for multidimensional linear partial differential operators. We consider all known types of Darboux transformations, and present a new type. We obtain a full classification of all operators that admit Wronskian type Darboux transformations of first order and a …
Introduces pseudo-codecomposition of transformation groups.
This paper investigates efficient Transformers and finds they scale with problem size.
The conformal geometry of spacelike surfaces in 4-dimensional Lorentzian space forms has been studied by the authors in a previous paper, where the so-called polar transform was introduced. Here it is shown that this transform preserves spacelike conformal isothermic surfaces. We relate this new transform with the know…
Transformation Equivariant Representations (TERs) aim to capture the intrinsic visual structures that equivary to various transformations by expanding the notion of {\em translation} equivariance underlying the success of Convolutional Neural Networks (CNNs). For this purpose, we present both deterministic AutoEncoding…
Data is said to follow the transform (or analysis) sparsity model if it becomes sparse when acted on by a linear operator called a sparsifying transform. Several algorithms have been designed to learn such a transform directly from data, and data-adaptive sparsifying transforms have demonstrated excellent performance i…