Study Bergman metric on Cartan-Hartogs domains and their duals.
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.
Trend · papers per month
Dual-structured method improves cross-domain imitation learning.
The paper explores symplectic geometry of Cartan-Hartogs domains.
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…
Extends polydisk theorem to Hartogs domains over symmetric domains.
Symplectic homology matches dual capacities for convex domains.
The paper explores dual learning, a technique that improves machine translation and image transformation.
We solve optimal consumption in a market with bounded risk.
Dual adversarial domain adaptation improves knowledge transfer between labeled and unlabeled domains.
Dual U-net models improve multi-channel MRI image reconstruction.
DMRL improves UDA by mixing source and target samples and enriching latent space structures.
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…
Local mappings relate dual and primal factor graphs for efficient marginal probability estimation.
Domain adaptation aims to exploit the knowledge in source domain to promote the learning tasks in target domain, which plays a critical role in real-world applications. Recently, lots of deep learning approaches based on autoencoders have achieved a significance performance in domain adaptation. However, most existing …
New algorithm learns optimal resource allocation in wireless systems without models.
Develops risk measures on Lipschitz spaces for financial positions.
Non-rigidity degree of a lattice , nrd, is dimension of the L-type domain to which belongs. We complete here the table of nrd's of all root lattices and their duals; namely, the hardest remaining case of , and the case of are decided. We describe explicitly the -type domain …
GPs with neural network dual kernels improve reinforcement learning performance.
New geometric structures defined on SPD matrices for better understanding.
Extends utility maximization theory for infinite horizons without strong no-arbitrage assumptions.
This paper discusses the numéraire-based utility maximization problem in markets with proportional transaction costs. In particular, the investor is required to liquidate all her position in stock at the terminal time. We first observe the stability of the primal and dual value functions as well as the convergence of t…
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…
New method improves generative modeling on convex domains using regularized mirror maps and Student-t priors.
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…
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…
Dual Variable Learning Rates improve neural network training efficiency.
We prove that the marginal densities of a global probability mass function in a primal normal factor graph and the corresponding marginal densities in the dual normal factor graph are related via local mappings. The mapping depends on the Fourier transform of the local factors of the models. Details of the mapping, inc…
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…
Cross-learning improves multi-task learning performance.
The abstract proves a conjecture about geometric structures in Calabi-Yau orbifolds.
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…
In this paper we prove that there exists a smooth classical solution to the HJB equation for a large class of constrained problems with utility functions that are not necessarily differentiable or strictly concave. The value function is smooth if admissible controls satisfy an integrability condition or if it is contin…
New metric defined for bounded symmetric domains.
In conventional domain adaptation, a critical assumption is that there exists a fully labeled domain (source) that contains the same label space as another unlabeled or scarcely labeled domain (target). However, in the real world, there often exist application scenarios in which both domains are partially labeled and n…
This article studies the sensitivity of the power utility maximization problem with respect to the investor's relative risk aversion, the statistical probability measure, the investment constraints and the market price of risk. We extend previous descriptions of the dual domain then exploit the link between the constra…
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…
New DG method minimizes barycentric alignment and reconstruction loss.
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…
In this paper we study the problem of maximizing expected utility from the terminal wealth with proportional transaction costs and random endowment. In the context of the existence of consistent price systems, we consider the duality between the primal utility maximization problem and the dual one, which is set up on t…
Study shows horofunction compactification's topology matches dual norm's unit ball.
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…
Mirror flows converge to a limiting flow with a convex potential.
Dual random fields improve mineral potential predictions.
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.
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…
This paper analyzes M-estimators under infinite-variance noise in high dimensions.
In this note, we study the utility maximization problem on the terminal wealth under proportional transaction costs and bounded random endowment. In particular, we restrict ourselves to the numéraire-based model and work with utility functions only supporting R+. Under the assumption of existence of consistent price sy…
The paper explores the geometric properties of fluid flows and their symmetries.