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

3775112149 · Jun 202019922001200920172026
48 results for partial duals

The paper characterizes when the \partial \overline{\partial}-lemma holds for twistor spaces.

problem Characterizing the \partial \overline{\partial}-lemma for twistor spaces.
method Study Bott-Chern and Aeppli cohomologies of twistor spaces.
result Explicit computation of Dolbeault cohomology for flat torus twistor space.

Dual-sPLS improves feature selection and prediction in high-dimensional data.

problem Relating variables to a response in high-dimensional chemometric problems.
method Generalizes PLS1 algorithm with dual norm penalizations and a shrinking ratio parameter.
result Favorably compares to similar regression methods on simulated and real chemical data.

Semi-supervised wrapper methods are concerned with building effective supervised classifiers from partially labeled data. Though previous works have succeeded in some fields, it is still difficult to apply semi-supervised wrapper methods to practice because the assumptions those methods rely on tend to be unrealistic i…

2016-11-12abs ↗pdf ↗

Paper explores how risk-averse individuals' willingness to pay for insurance varies with risk probability.

problem Understanding how risk-averse individuals' willingness to pay for insurance varies with risk probability.
method Analyzes willingness to pay (WTP) for partial risk reduction within the dual theory of decision.
result In dual theory, reducing the probability of risk and providing insurance can be complementary if the surplus increases with risk reduction.

Paper proposes a method to recover point configurations from noisy distance data.

problem Recovering point configurations from noisy distance data.
method Robust Euclidean Distance Geometry via Dual Basis (RoDEoDB) algorithm.
result Exact recovery guarantees for point configuration and Gram matrix under mild conditions.

Improved RL algorithm with linear MDPs for offline learning with partial data coverage.

problem Efficient offline RL with linear MDPs under partial data coverage.
method Primal-dual algorithm with O(ε2)O(ε^{-2}) sample complexity.
result First computationally efficient algorithm with O(ε2)O(ε^{-2}) sample complexity for offline RL with linear MDPs under partial data coverage.

Study robust distribution estimation with Wasserstein distance, achieving optimal risk.

problem Robust distribution estimation under adversarial corruption.
method Combining partial OT and minimum distance estimation, proving structural properties and deriving a novel dual form.
result Achieves minimax-optimal robust estimation risk in many settings.

A unique hyperbolic metric is found for each spherical cone-metric on the boundary of a hyperbolizable 3-manifold.

problem Finding a hyperbolic metric for a given spherical cone-metric on the boundary of a hyperbolizable 3-manifold.
method Constructing a strictly polyhedral hyperbolic metric on the 3-manifold such that the given spherical cone-metric is the induced dual metric on the boundary.
result The existence and uniqueness of a strictly polyhedral hyperbolic metric for a given spherical cone-metric on the boundary of a hyperbolizable 3-manifold.

In approachability with full monitoring there are two types of conditions that are known to be equivalent for convex sets: a primal and a dual condition. The primal one is of the form: a set C is approachable if and only all containing half-spaces are approachable in the one-shot game; while the dual one is of the form…

2013-05-23abs ↗pdf ↗

The paper tackles partial inference in structured prediction using a convex optimization approach.

problem Maximizing a score function with unary and pairwise potentials in graph label spaces.
method Generative model approach with two-stage convex optimization for label recovery.
result Conditions for recovering a majority of labels with provable guarantees.

New method for classifying disk embeddings in 4-manifolds.

problem Classifying smooth isotopy classes of neat embeddings of 2-disks in 4-manifolds.
method Using an invariant going back to Dax, constructing a group structure, and relating to mapping class groups.
result The group structure on isotopy classes of neat embeddings is usually not abelian or finitely generated.

Oracle-efficient algorithm for offline RL with partial data coverage.

problem Offline reinforcement learning with partial data coverage and constraints.
method PDOCRL, a primal-dual algorithm with decomposed linear-programming formulation.
result Near-optimal, near-feasible policy with \(\widetilde{\mathcal O}(ε^{-2})\) sample guarantee.

We establish that, over certain ground fields, the set of osculating tangents of Cayley's ruled cubic surface gives rise to a (maximal partial) spread which is also a dual (maximal partial) spread. It is precisely the Betten-Walker spreads that allow for this construction. Every infinite Betten-Walker spread is not an …

2013-03-31abs ↗pdf ↗

Paper tackles distribution matching by partially matching distributions, achieving robust results.

problem Robustly aligning two probability distributions.
method Developed a partial Wasserstein adversarial network (PWAN) to efficiently approximate the partial Wasserstein-1 (PW) discrepancy.
result The PWAN effectively produces highly robust matching results, outperforming state-of-the-art methods.

Affine manifolds linked to integrable equations and geometric structures.

problem Understanding the geometric and algebraic properties of affine manifolds.
method Analyzing the Kahlerian tangent bundle and multi-dimensional consistency of the TED equation.
result Affine manifolds are related to self-dual Einstein spaces and Hessian structures.

Partial connections are (singular) differential systems generalizing classical connections on principal bundles, yielding analogous decompositions for manifolds with nonfree group actions. Connection forms are interpreted as maps determining projections of the tangent bundle onto the partial connection; this approach e…

2003-09-14abs ↗pdf ↗

Study anisotropic flows without global terms and solve dual Orlicz Christoffel-Minkowski problems.

problem Anisotropic flows without global forcing terms and dual Orlicz Christoffel-Minkowski problems.
method Existence results for dual Orlicz Christoffel-Minkowski type problems via stationary solutions of anisotropic flows.
result Existence results for a class of dual Orlicz Christoffel-Minkowski type problems.

Dual PC algorithm improves structure learning of Bayesian networks.

problem Learning the structure of Bayesian networks from observational data.
method Dual PC algorithm, leveraging covariance and precision matrices, and partial correlations.
result The dual PC algorithm outperforms the classic PC algorithm in structure recovery, even with non-Gaussian data.

Dual-space sampling tackles ill-conditioned inverse problems with Bayesian methods.

problem Bayesian inference in constrained inverse problems with ill-conditioned solutions.
method Dual-space posterior sampling using ADMM and SVGD.
result Well-calibrated uncertainty estimates and posterior contraction with increasing data.

We study second-order PDEs in 4D for which the conformal structure defined by the characteristic variety of the equation is half-flat (self-dual or anti-self-dual) on every solution. We prove that this requirement implies the Monge-Ampere property. Since half-flatness of the conformal structure is equivalent to the exi…

2020-02-02abs ↗pdf ↗

Coordinate descent methods employ random partial updates of decision variables in order to solve huge-scale convex optimization problems. In this work, we introduce new adaptive rules for the random selection of their updates. By adaptive, we mean that our selection rules are based on the dual residual or the primal-du…

2017-03-07abs ↗pdf ↗

We study an optimal control problem related to swing option pricing in a general non-Markovian setting in continuous time. As a main result we show that the value process solves a first-order non-linear backward stochastic partial differential equation. Based on this result we can characterize the set of optimal contro…

2013-05-17abs ↗pdf ↗

This paper is concerned with the construction of special metrics on non-compact 4-manifolds which arise as resolutions of complex orbifold singularities. Our study is close in spirit to the construction of the hyperkaehler gravitational instantons, but we focus on a different class of singularities. We show that any re…

2002-06-21abs ↗pdf ↗

A novel semi-supervised outlier detection model detects anomalies with few labels.

problem Efficiently detecting group anomalies with limited labeled data.
method RCC-Dual-GAN model that combines RCC and M-GAN components for semi-supervised outlier detection.
result Significantly improved accuracy in outlier detection with few labeled anomalies.

This paper examines how data affects risk measures in uncertain distributions.

problem How does distributional ambiguity affect risk measures?
method Formulated and derived simpler dual problems for infinite and finite dimensional robust moment problems.
result Developed theory and conducted experiments in inventory control and portfolio management.

The paper proves a logarithmic partial derivative lemma and applies it to several geometric problems.

problem Proving a logarithmic partial derivative lemma for compact Kähler manifolds.
method Developed a new ˉ\partial\bar{\partial}-type lemma for logarithmic differential forms.
result Confirmed a conjecture by X. Wan and derived several geometric applications.

Paper solves a new Minkowski problem for a specific type of rigidity.

problem Solving a new Minkowski problem for a specific type of rigidity.
method Developed a nonlinear partial differential equation and used a curvature flow method.
result Existence of smooth non-even solutions to the p-th dual Minkowski problem for p < n-2.

DCGD improves training of PINNs by adjusting gradients to avoid negative inner products.

problem Pathological behaviors in PINNs training, especially gradient imbalance.
method Dual Cone Gradient Descent (DCGD) framework to adjust gradient direction.
result DCGD outperforms other optimization algorithms in various evaluation metrics.

Proposes TgNN-LD to improve neural network effectiveness and efficiency.

problem Limits in maintaining tradeoff between data and domain knowledge.
method Converts loss function to constrained form with PDEs, ECs, and EK as constraints, incorporating Lagrangian variables for equitable tradeoff.
result Improves prediction accuracy and conserves resources.

The paper calculates bounds for risk metrics and entropies under partial information constraints.

problem Analyzing risk metrics and entropies for unimodal, symmetric distributions with limited information.
method Develops lower and upper bounds for worst-case distortion riskmetrics and weighted entropy for unimodal, symmetric distributions with known mean and variance.
result Sharp upper bounds for distortion riskmetrics and weighted entropy for symmetric distributions.

FairDTD improves fairness in GNNs by distilling dual teacher knowledge, balancing utility and bias.

problem Bias in GNN predictions due to sensitive attributes.
method Dual-Teacher Distillation with a causal graph model, feature and structure teachers, and graph-level distillation.
result Achieves optimal fairness while preserving high model utility.