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

Trend · papers per month

12243648 · Jun 202019922001200920172026
48 results for dual convexification

DCCNNs reduce computational overhead and ambiguity in convolutional neural networks.

problem Reducing computational overhead and ambiguity in convolutional neural networks.
method Introducing a primal learning problem and constructing a dual convex training program, using Fenchel conjugates and Karush-Kuhn-Tucker conditions.
result Eliminates ambiguity and reduces computational overhead in constructing a large kernel matrix.

Partial convexification improves tractability of low-rank spectral optimization problems.

problem Minimizing linear objectives subject to matrix inequalities and low-rank constraints.
method Partial convexification of the domain set, deriving rank bounds, and developing a column generation algorithm.
result The partial convexification LSOP-R is equivalent to the original LSOP under certain conditions and yields high-quality solutions.

The paper extends a neural model to estimate uncertainty in multi-interaction trajectory reconstruction.

problem Lack of uncertainty estimation in neural models for multi-interaction trajectory reconstruction.
method Extended Factorised Neural Relational Inference model to output mean and standard deviation for each component of the phase space vector, using various loss functions.
result Demonstrated the importance of physical meaning of variables and existence of local minima during training.

The paper tackles fairness in forecasting and learning linear dynamical systems.

problem Under-representation bias in training data for multiple subgroups.
method Introducing subgroup-fair and instant-fair learning of LDS from multiple trajectories of varying lengths, using hierarchies of convexifications of non-commutative polynomial optimisation problems.
result Empirical results show both the beneficial impact of fairness considerations on statistical performance and encouraging effects of exploiting sparsity on run time.

Signal estimation problems with smoothness and sparsity priors can be naturally modeled as quadratic optimization with 0\ell_0-"norm" constraints. Since such problems are non-convex and hard-to-solve, the standard approach is, instead, to tackle their convex surrogates based on 1\ell_1-norm relaxations. In this paper…

2018-11-06abs ↗pdf ↗

Proposes a method to solve deep neural networks' local minimum problem.

problem Local minimum problem in deep neural networks training.
method Transforms cross-entropy loss into risk-averse error criterion, adjusts RSI, and uses convexity region.
result Trained deep learning machine is expected to be inside a global minimum's attraction basin.

Traditionally, most complex intelligence architectures are extremely non-convex, which could not be well performed by convex optimization. However, this paper decomposes complex structures into three types of nodes: operators, algorithms and functions. Iteratively, propagating from node to node along edge, we prove tha…

2018-01-09abs ↗pdf ↗

We introduce normalized nonnegative models (NNM) for explorative data analysis. NNMs are partial convexifications of models from probability theory. We demonstrate their value at the example of item recommendation. We show that NNM-based recommender systems satisfy three criteria that all recommender systems should ide…

2015-11-15abs ↗pdf ↗

Regularized empirical risk minimization with constrained labels (in contrast to fixed labels) is a remarkably general abstraction of learning. For common loss and regularization functions, this optimization problem assumes the form of a mixed integer program (MIP) whose objective function is non-convex. In this form, t…

2016-02-22abs ↗pdf ↗

Given a C1C^1 planes distribution PTP_T on all Rm{\mathbb R}^m we consider {\em horizontal αα-harmonic maps}, α1/2α\ge 1/2, with respect to such a distribution. These are maps uHα(Rk,Rm)u\in H^α({\mathbb R}^k,{\mathbb R}^m) satisfying PTu=uP_T\nabla u=\nabla u and PT(u)(Δ)αu=0P_T(u)(-Δ)^αu=0 in D(Rk).{\mathcal D}'({\mathbb R}^k). If the distrib…

2016-04-19abs ↗pdf ↗

Sparse regression models are increasingly prevalent due to their ease of interpretability and superior out-of-sample performance. However, the exact model of sparse regression with an 0\ell_0 constraint restricting the support of the estimators is a challenging (\NP-hard) non-convex optimization problem. In this paper…

2019-01-29abs ↗pdf ↗

New bounds show complexity of adversarial decision making.

problem Understanding sample efficiency in adversarial decision making.
method New upper and lower bounds on Decision-Estimation Coefficient.
result Decision-Estimation Coefficient is necessary and sufficient for low regret in adversarial decision making.

Dual spherical conchoidal motion has been defined by Yapar. In this work, we define this motion on a dual hyperbolic unit sphere in the dual Lorentzian space with dual signature, and the results carried to the Lorentzian lines space by means of the Study s mapping. We also obtain the study maps of the orbits drawn on t…

2013-11-10abs ↗pdf ↗

Study of curves in dual space with constant curvature and torsion.

problem Classifying curves in dual space with specific geometric properties.
method Defined curvature and torsion for curves in dual space, classified curves with constant properties, and proved existence theorems.
result Established fundamental theorem of existence for dual curves with prescribed curvature and torsion.

The paper classifies curves in dual affine and Lorentz-Minkowski planes with constant curvature.

problem Classifying curves with constant curvature in dual affine and Lorentz-Minkowski planes.
method Investigation of invariants under equiaffine transformations and explicit equations for curves with constant curvature.
result Curves with constant curvature in dual affine and Lorentz-Minkowski planes are classified.

In this paper, the dual Orlicz curvature measure is proposed and its basic properties are provided. A variational formula for the dual Orlicz-quermassintegral is established in order to give a geometric interpretation of the dual Orlicz curvature measure. Based on the established variational formula, a solution to the …

2017-03-20abs ↗pdf ↗

Geodesic currents on hyperbolic surfaces have dual spaces that are metric trees.

problem Understanding the dual spaces of geodesic currents on hyperbolic surfaces.
method Analyzing the geometric properties of dual spaces, including their hyperbolicity and completeness.
result The dual spaces of geodesic currents are Gromov hyperbolic metric tree-graded spaces.

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.

Dehn surgery on a knot determines a dual knot in the surgered manifold, the core of the filling torus. We consider duals of knots in S3S^3 that have a lens space surgery. Each dual supports a contact structure. We show that if a universally tight contact structure is supported, then the dual is in the same homology cla…

2014-11-13abs ↗pdf ↗

This paper solves the dual Minkowski problem for q-torsional rigidity.

problem The dual Minkowski problem for q-torsional rigidity.
method Introduced the p-th dual q-torsional measure and solved the p-th dual Minkowski problem for q-torsional rigidity using a Gauss curvature flow.
result Existence of smooth even and non-even solutions to the p-th dual Minkowski problem for q-torsional rigidity.

Weak dual pairs defined in Dirac-Jacobi geometry, proving equivalence and leaf correspondence theorems.

problem Defining and studying weak dual pairs in Dirac-Jacobi structures.
method Adopting omni-Lie algebroid approach, proving equivalence and leaf correspondence theorems.
result Existence of self-dual pairs and alternative proof of normal form theorem.

The aim of this paper is to develop a general framework for training neural networks (NNs) in a distributed environment, where training data is partitioned over a set of agents that communicate with each other through a sparse, possibly time-varying, connectivity pattern. In such distributed scenario, the training prob…

2016-10-24abs ↗pdf ↗

We provide a dual representation of quasiconvex maps between two lattices of random variables in terms of conditional expectations. This generalizes the dual representation of quasiconvex real valued functions and the dual representation of conditional convex maps.

2010-01-20abs ↗pdf ↗

In this paper, we study Mannheim surface offsets in dual space. By the aid of the E. Study Mapping, we consider ruled surfaces as dual unit spherical curves and define the Mannheim offsets of the ruled surfaces by means of dual geodesic trihedron (dual Darboux frame). We obtain the relationships between the invariants …

2011-10-05abs ↗pdf ↗

Researchers prove uniqueness and continuity of solution to L_p dual Minkowski problem.

problem Proving uniqueness and continuity of solution to L_p dual Minkowski problem.
method Established new Minkowski-type inequalities related to optimization problem.
result Uniqueness and continuity of solution for general convex bodies when q<pq < p.

Dual representations for robust risk measures and uncertainty sets.

problem Characterizing continuity of robust risk measures and their uncertainty sets.
method Develop dual representations for robust risk measures and uncertainty sets based on distinct geometric assumptions.
result Two dual frameworks for consolidated uncertainty sets are complementary, not interchangeable.

Let {P1,P2,P3,P4}\{P_1, P_2, P_3, P_4\} be a quadruplet of points in S3S^3 . We define a ``dual'' quadruplet of it in a conformal geometric way. We show that the dual of a dual quadruplet coincides with the original one. We also show that the cross ratio of the dual quadruplet is equal to the complex conjugate of that of the orig…

2007-09-04abs ↗pdf ↗

Classifies self-dual almost-Kähler 4-manifolds, proving uniqueness up to rescaling.

problem Classifying self-dual almost-Kähler four-manifolds.
method Using LeBrun's result and properties of Ricci tensor, the authors classify manifolds of different types.
result Any self-dual almost-Kähler metric on CP2\mathbb{CP}_{2} is the Fubini-Study metric up to rescaling.

We introduce and study the notion of contact dual pair adopting a line bundle approach to contact and Jacobi geometry. A contact dual pair is a pair of Jacobi morphisms defined on the same contact manifold and satisfying a certain orthogonality condition. Contact groupoids and contact reduction are the main sources of …

2019-03-12abs ↗pdf ↗

Study anisotropic inverse Gauss curvature flows and solve dual Orlicz Minkowski problems.

problem Solving dual Orlicz Minkowski problems for anisotropic flows.
method Anisotropic inverse Gauss curvature flows and stationary solutions.
result New existence results for dual Orlicz Minkowski problems for smooth measures.

Many supervised learning tasks are emerged in dual forms, e.g., English-to-French translation vs. French-to-English translation, speech recognition vs. text to speech, and image classification vs. image generation. Two dual tasks have intrinsic connections with each other due to the probabilistic correlation between th…

2017-07-03abs ↗pdf ↗