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

Trend · papers per month

71143214285 · Jun 202019922001200920172026
48 results for Dual Domain

In this paper we propose a novel dual adversarial co-learning approach for multi-domain text classification (MDTC). The approach learns shared-private networks for feature extraction and deploys dual adversarial regularizations to align features across different domains and between labeled and unlabeled data simultaneo…

2019-09-18abs ↗pdf ↗

Extends polydisk theorem to Hartogs domains over symmetric domains.

problem Rigidity phenomena in Riemannian manifolds.
method Extension of polydisk theorem to Hartogs domains over arbitrary symmetric domains.
result Dual of a Hartogs domain over a bounded symmetric domain admits no totally geodesic immersion into any compact Riemannian manifold.

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.

The paper explores dual learning, a technique that improves machine translation and image transformation.

problem Understanding and improving dual learning's effectiveness and conditions.
method Theoretical analysis and algorithmic extension of dual learning.
result Multi-step dual learning boosts performance under mild conditions.

Dual adversarial domain adaptation improves knowledge transfer between labeled and unlabeled domains.

problem Transfer knowledge from labeled to unlabeled domains using unsupervised methods.
method Adopt a discriminator with 2K-dimensional output for both domain-level and class-level alignments. Design a dual adversarial mechanism to pit two discriminators against each other.
result Our method outperforms state-of-the-art domain adaptation methods on real-world datasets.

DMRL improves UDA by mixing source and target samples and enriching latent space structures.

problem Lack of class-aware information and insufficient samples for domain-invariant feature extraction.
method Dual Mixup Regularized Learning (DMRL) that conducts category and domain mixup regularizations.
result DMRL achieves state-of-the-art performance on domain adaptation benchmarks.

The wavelet transform has seen success when incorporated into neural network architectures, such as in wavelet scattering networks. More recently, it has been shown that the dual-tree complex wavelet transform can provide better representations than the standard transform. With this in mind, we extend our previous meth…

2018-06-04abs ↗pdf ↗

Local mappings relate dual and primal factor graphs for efficient marginal probability estimation.

problem Efficient estimation of marginal probabilities in statistical physics models.
method Local mappings based on Fourier transform of local factors, applied to Ising, Potts, and clock models.
result Local extrema of fixed points are at phase transition points, and the mapping facilitates efficient estimation.

New algorithm learns optimal resource allocation in wireless systems without models.

problem Learning optimal resource allocation in wireless systems without system models.
method Developed a model-free primal-dual algorithm using smoothed surrogates of constrained problems.
result The algorithm can make the gap between optimal values and dual values arbitrarily small.

Non-rigidity degree of a lattice LL, nrdLL, is dimension of the L-type domain to which LL belongs. We complete here the table of nrd's of all root lattices and their duals; namely, the hardest remaining case of DnD_n^*, and the case of E7E_7^* are decided. We describe explicitly the LL-type domain D(Dn){\cal D}(D_n^*)

2002-02-11abs ↗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.

New geometric structures defined on SPD matrices for better understanding.

problem Understanding SPD matrices and their geometric properties.
method Introducing Finslerian and dual information-geometric structures on James' bicone domain.
result Geodesics correspond to straight lines in coordinate systems, and new dissimilarities generalize existing ones.

Extends utility maximization theory for infinite horizons without strong no-arbitrage assumptions.

problem Maximizing lifetime utility from wealth over an infinite horizon.
method Develops a duality theory using deflators and supermartingale properties, extending previous work.
result Establishes a strong duality theorem for infinite horizon utility maximization under minimal no-arbitrage assumptions.

In this paper, we study randomized reduction methods, which reduce high-dimensional features into low-dimensional space by randomized methods (e.g., random projection, random hashing), for large-scale high-dimensional classification. Previous theoretical results on randomized reduction methods hinge on strong assumptio…

2015-04-15abs ↗pdf ↗

New method improves generative modeling on convex domains using regularized mirror maps and Student-t priors.

problem Challenges in generative modeling on convex domains with heavy-tailed targets.
method Mirror Flow Matching with regularized mirror maps and Student-t priors.
result Empirically outperforms baselines and achieves competitive sample quality.

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 ↗

The cross-domain recommendation technique is an effective way of alleviating the data sparse issue in recommender systems by leveraging the knowledge from relevant domains. Transfer learning is a class of algorithms underlying these techniques. In this paper, we propose a novel transfer learning approach for cross-doma…

2018-04-18abs ↗pdf ↗

Dual Variable Learning Rates improve neural network training efficiency.

problem Training neural networks efficiently and effectively.
method DVLR uses different learning rates for correct and incorrect responses, and adjusts rates based on network performance.
result DVLR consistently improves neural network accuracy across different types and domains.

Mixed finite element methods solve a PDE using two or more variables. The theory of Discrete Exterior Calculus explains why the degrees of freedom associated to the different variables should be stored on both primal and dual domain meshes with a discrete Hodge star used to transfer information between the meshes. We s…

2010-12-17abs ↗pdf ↗

The abstract proves a conjecture about geometric structures in Calabi-Yau orbifolds.

problem Proving a conjecture about geometric structures in Calabi-Yau orbifolds.
method Using the Koopman--von Neumann formulation of Landau--Ginzburg theory and a Lagrangian torus fibration.
result The base of the SYZ fibration is a Monge--Ampère domain (the open simplex) for all Berglund--Hübsch--Krawitz mirror pairs.

The main results in this paper provide upper bounds of the second order Dehn functions for three-dimensional groups Nil and Sol. These upper bounds are obtained by using the Varopoulos transport argument on dual graphs. The first step is to start with reduced handlebody diagrams of the three-dimensional balls either im…

2010-10-17abs ↗pdf ↗

We introduce in this paper a novel strategy for efficiently approximating the Sinkhorn distance between two discrete measures. After identifying neglectable components of the dual solution of the regularized Sinkhorn problem, we propose to screen those components by directly setting them at that value before entering t…

2019-06-20abs ↗pdf ↗

Visual Question Answering (VQA) requires AI models to comprehend data in two domains, vision and text. Current state-of-the-art models use learned attention mechanisms to extract relevant information from the input domains to answer a certain question. Thus, robust attention mechanisms are essential for powerful VQA mo…

2018-02-01abs ↗pdf ↗

We study the Dirichlet problem for fully nonlinear, degenerate elliptic equations of the form f(Hess, u)=0 on a smoothly bounded domain D in R^n. In our approach the equation is replaced by a subset F of the space of symmetric nxn-matrices, with bdy(F) contined in the set {f=0}. We establish the existence and uniquenes…

2007-10-22abs ↗pdf ↗

We give a sharp lower bound on the area of the domain enclosed by an embedded curve lying on a two-dimensional sphere, provided that geodesic curvature of this curve is bounded from below. Furthermore, we prove some dual inequalities for convex curves whose curvatures are bounded from above.

2016-05-30abs ↗pdf ↗

This paper considers the design of optimal resource allocation policies in wireless communication systems which are generically modeled as a functional optimization problem with stochastic constraints. These optimization problems have the structure of a learning problem in which the statistical loss appears as a constr…

2018-07-21abs ↗pdf ↗

This paper analyzes M-estimators under infinite-variance noise in high dimensions.

problem High-dimensional M-estimation with infinite-variance noise.
method Study of the Fenchel conjugate domain and its impact on risk.
result Exact risk of M-estimators under infinite-variance noise is derived.

The paper explores the geometric properties of fluid flows and their symmetries.

problem Understanding the geometric properties of fluid flows and their symmetries.
method Analyzing the Euler equation and its relation to geodesic flows on groupoids of multiphase diffeomorphisms.
result Generalized flows, multiphase fluids, and vortex sheets are all geodesics on certain groupoids of multiphase diffeomorphisms.