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

3977116154 · Jun 202019922001200920172026
48 results for Dual encoder

Improves dialogue response model interpretability using attention and regularization.

problem Improving interpretability of dual encoder models for dialogue response suggestions.
method Integrates attention mechanism and novel regularization loss to emphasize important words.
result Improves model accuracy and interpretability compared to existing methods.

The paper explores how AI systems use information geometry to encode semantic structure.

problem How AI systems encode semantic structure into geometric representation spaces.
method Focuses on softmax distributions and develops dual steering method for robust concept manipulation.
result Dual steering optimally modifies target concepts while minimizing off-target changes.

We introduce self-dual manifolds and show that they can be used to encode mirror symmetry for affine-Kähler manifolds and for elliptic curves. Their geometric properties, especially the link with special lagrangian fibrations and the existence of a transformation similar to the Fourier-Mukai functor, suggest that this …

2002-02-02abs ↗pdf ↗

The local kinematic formulas on complex space forms induce the structure of a commutative algebra on the space CurvU(n)\mathrm{Curv}^{\mathrm{U}(n)*} of dual unitarily invariant curvature measures. Building on the recent results from integral geometry in complex space forms, we describe this algebra structure explicitly as a…

2017-02-07abs ↗pdf ↗

We propose a new architecture called Memory-Augmented Encoder-Solver (MAES) that enables transfer learning to solve complex working memory tasks adapted from cognitive psychology. It uses dual recurrent neural network controllers, inside the encoder and solver, respectively, that interface with a shared memory module a…

2018-09-28abs ↗pdf ↗

CADE learns dual node representations for better generalization.

problem Transductive graph embeddings cannot generalize to unseen nodes or across different graphs.
method CADE combines real-time neighborhoods with neighbor-attentioned representation, preserving known node memory.
result CADE outperforms state-of-the-art methods in generalization and context-awareness.

A new deep learning framework selects representative samples for unsupervised learning.

problem Selecting representative samples for unsupervised learning in non-linear data.
method DUAL framework using an encoder-decoder architecture to learn nonlinear embeddings and a selection block to choose representative samples.
result DUAL outperforms state-of-the-art methods in selecting representative samples for unsupervised learning.

We prove that higher moment maps on area measures of a euclidean vector space are injective, while the kernel of the centroid map equals the image of the first variation map. Based on this, we introduce the space of smooth dual area measures on a finite-dimensional euclidean vector space and prove that it admits a natu…

2017-03-23abs ↗pdf ↗

How to generate human like response is one of the most challenging tasks for artificial intelligence. In a real application, after reading the same post different people might write responses with positive or negative sentiment according to their own experiences and attitudes. To simulate this procedure, we propose a s…

2019-05-16abs ↗pdf ↗

We introduce Primal-Dual Wasserstein GAN, a new learning algorithm for building latent variable models of the data distribution based on the primal and the dual formulations of the optimal transport (OT) problem. We utilize the primal formulation to learn a flexible inference mechanism and to create an optimal approxim…

2018-05-24abs ↗pdf ↗

GPs with neural network dual kernels improve reinforcement learning performance.

problem Combining the strengths of DNNs and GPs for reinforcement learning.
method Apply GPs with neural network dual kernels to solve reinforcement learning tasks.
result GPs with neural network dual kernels perform at least as well as conventional methods on the mountain-car problem.

Graph convolutional networks (GCNs) have shown the powerful ability in text structure representation and effectively facilitate the task of text classification. However, challenges still exist in adapting GCN on learning discriminative features from texts due to the main issue of graph variants incurred by the textual …

2019-11-28abs ↗pdf ↗

We consider sphere bundles P and P' of totally null planes of maximal dimension and opposite self-duality over a 4-dimensional manifold equipped with a Weyl or Riemannian geometry. The fibre product PP' of P and P' is found to be appropriate for the encoding of both the selfdual and the Einstein-Weyl equations for the …

1996-10-27abs ↗pdf ↗

Unified MTL framework for heterogeneous data integrates shared and task-specific encoders.

problem Efficiently sharing information across multiple tasks with heterogeneous data.
method Dual-encoder framework with task-shared and task-specific encoders.
result Unified algorithm alternates learning task-specific and shared encoders and coefficients.

Paper tackles class-incremental time series classification with dual-stream feature extraction.

problem Class-incremental continual learning for multivariate time series data.
method Dual-stream feature extraction pipeline combining deep temporal embedding features and statistical features.
result Competitive average accuracy across multiple datasets with low forgetting rates.

This paper undertakes a study of the structure of the fibers of the Chevalley exponentiation maps f(i1,,id)f_{(i_1,\dots ,i_d)}. The fibers of these maps f(i1,,id)f_{(i_1,\dots ,i_d)} encode the nonnegative real relations amongst exponentiated Chevalley generators. Our main theorems show that the fibers admit cell stratifications, t…

2019-03-04abs ↗pdf ↗

This paper proposes an embedding-based neural network for more accurate investment return prediction.

problem Accurately predicting investment returns requires understanding industry knowledge and news, as well as leveraging relevant theories.
method The approach uses embedding to encode investment IDs into low-dimensional vectors, leveraging dual branches to separate different information, and employs the swish activation function.
result The proposed embedding-based dual branch model outperforms traditional machine learning models like Xgboost, Lightgbm, and Catboost on the Ubiquant Market Prediction dataset.

We uncover and highlight relations between the M-branes in M-theory and various topological invariants: the Hopf invariant over Q\mathbb{Q}, Z\mathbb{Z} and Z2\mathbb{Z}_2, the Kervaire invariant, the ff-invariant, and the νν-invariant. This requires either a framing or a corner structure. The canonical framing pro…

2013-10-03abs ↗pdf ↗

Symplectic homology matches dual capacities for convex domains.

problem Understanding symplectic capacities and Reeb flows on convex domains.
method Isomorphic filtered symplectic homology to dual singular homology.
result Gutt-Hutchings capacities match spectral invariants for convex domains.

We discuss relations between quantum BPS invariants defined in terms of a product decomposition of certain series, and difference equations (quantum A-polynomials) that annihilate such series. We construct combinatorial models whose structure is encoded in the form of such difference equations, and whose generating fun…

2016-08-23abs ↗pdf ↗

Motivated by recent developments in the AdS/CFT correspondence, we provide several alternative bulk descriptions of an arbitrary Wilson loop operator in Chern-Simons theory. Wilson loop operators in Chern-Simons theory can be given a description in terms of a configuration of branes or alternatively anti-branes in the …

2006-12-19abs ↗pdf ↗

This paper studies the interplay between the N=2 gauge theories in three and four dimensions that have a geometric description in terms of twisted compactification of the six-dimensional (2,0) SCFT. Our main goal is to construct the three-dimensional domain walls associated to any three-dimensional cobordism. We find t…

2013-04-24abs ↗pdf ↗

EGAE improves graph clustering by utilizing GAE's representations in a way consistent with relaxed k-means theory.

problem Improving graph clustering performance using unsupervised methods.
method Designing an Embedding Graph Auto-Encoder (EGAE) that aligns with theoretical relaxed k-means to learn explainable representations.
result EGAE achieves superior graph clustering results compared to existing methods.

CADGMM detects anomalies by capturing complex correlations in data.

problem Detecting anomalies in complex, unstructured data.
method CADGMM uses a graph structure to encode correlations, then a dual-encoder to learn low-dimensional latent space, followed by a Gaussian Mixture Model for anomaly detection.
result CADGMM effectively detects anomalies in real-world datasets.

Four-dimensional quaternion-Kahler metrics, or equivalently self-dual Einstein spaces M, are known to be encoded locally into one real function h subject to Przanowski's Heavenly equation. We elucidate the relation between this description and the usual twistor description for quaternion-Kahler spaces. In particular, w…

2009-12-17abs ↗pdf ↗

Study presents a method to induce a generalized neural network from joint group invariant functions.

problem Encoding rule of neural network internal data representation.
method Systematic method using joint group invariant function on data-parameter domain.
result Induces a generalized neural network and its inverse operator (ridgelet transform).

Systemic risk measures are crucial for the stability of financial markets, yet classical formulations fail to capture the complexity of market volatility. We propose a new framework for systemic risk measurement on the variable-exponent Bochner-Lebesgue space Lp()L^{p(\cdot)}, where the exponent p()p(\cdot) is a random va…

2018-11-30abs ↗pdf ↗

CardiCat generates synthetic data for high-cardinality tabular datasets.

problem Learning complexities of high-cardinality categorical features in tabular data.
method Substitutes one-hot encoding with regularized dual encoder-decoder embedding layers.
result Generates high-quality synthetic data with a smaller parameter space.

Paper develops efficient estimator for Hawkes processes using representer theorem.

problem Estimating latent triggering kernels for Hawkes processes from event sequences.
method Penalized least squares minimization in RKHS framework.
result Efficient estimator with competitive accuracy and improved computational efficiency.

Study reveals LLM personas have two distinct components: frame-robust aggregated traits and frame-dependent geometric features.

problem Evaluation of LLM personas via psychometric questionnaires discards within-instance correlation structure.
method Constructed within-instance correlation matrices from IPIP-50 responses and analyzed geometry on SPD manifolds under manipulated question orderings.
result Persona expression comprises two dissociable components: aggregated features (Big Five scores) and geometric features (SPD manifold).

engGNN combines external and generated graphs to improve disease classification and biomarker discovery.

problem Challenges in integrating omics data due to high dimensionality and small sample sizes.
method Dual-graph framework that integrates external biological networks with data-driven generated graphs.
result engGNN outperforms state-of-the-art methods in disease classification and biomarker discovery.