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.

169,051 papers · 148 categories

Trend · papers per month

82163245326 · Jun 202019922001200920172026
48 results for desirability theory

The paper tackles matching a desired mean in causal systems through shift interventions.

problem Matching a desired mean in causal systems.
method Defining Markov equivalence classes, proposing active learning strategies, deriving lower bounds.
result Proposed active learning strategies require fewer interventions than previous approaches, especially for certain graph classes.

Optimizes electric field to control molecule states in Hartree-Fock theory.

problem Optimizing electric field to drive molecule from initial to target state.
method Trust region optimization with gradients from adjoint state method.
result Achieves desired target states with minimal control effort.

Uniform covers with a finite-dimensional nerve are rare (i.e., do not form a cofinal family) in many separable metric spaces of interest. To get hold on uniform homotopy properties of these spaces, a reasonably behaved notion of an infinite-dimensional metric polyhedron is needed; a specific list of desired properties …

2011-09-02abs ↗pdf ↗

In fivebrane compactifications on 3-manifolds, we point out the importance of all flat connections in the proper definition of the effective 3d N=2 theory. The Lagrangians of some theories with the desired properties can be constructed with the help of homological knot invariants that categorify colored Jones polynomia…

2014-05-14abs ↗pdf ↗

For SU(2)SU(2) (or SO(3)SO(3)) Donaldson theory on a 4-manifold XX, we construct a simple geometric representative for μμ of a point. Let pp be a generic point in XX. Then the set {[A]FA(p)\{ [A] | F_A^-(p) is reducible }\}, with coefficient -1/4 and appropriate orientation, is our desired geometric representative.

1995-01-12abs ↗pdf ↗

The study improves compound selection in in silico screening by focusing on model's ability to predict desirable outcomes.

problem Improving compound selection in in silico screening to reduce errors and enhance generalization.
method Extending learning theory, the study analyzes the impact of selection policies on generalization and proposes a method to mitigate challenges.
result Generalization can be enhanced by considering a model's ability to predict the fraction of desired outcomes in a batch.

We will simplify earlier proofs of Perelman's collapsing theorem for 3-manifolds given by Shioya-Yamaguchi and Morgan-Tian. Among other things, we use Perelman's critical point theory (e.g., multiple conic singularity theory and his fibration theory) for Alexandrov spaces to construct the desired local Seifert fibratio…

2010-03-10abs ↗pdf ↗

Investigates the impact of finite VC dimension on neural network approximation and learning.

problem The influence of VC dimension on neural network approximation and learning from samples.
method Analysis of high-dimensional geometry and statistical learning theory, focusing on VC dimension.
result Finite VC dimension is beneficial for uniform convergence of empirical errors but not for approximation of functions from a probability distribution.

Diversification represents the idea of choosing variety over uniformity. Within the theory of choice, desirability of diversification is axiomatized as preference for a convex combination of choices that are equivalently ranked. This corresponds to the notion of risk aversion when one assumes the von-Neumann-Morgenster…

2015-07-08abs ↗pdf ↗

New trading policies preserve robust gains in presence of transaction costs.

problem Maintaining robust gains in asset trading with transaction costs.
method Proposed double linear trading policies, analyzed with Monte Carlo simulations and historical data.
result Desired robust positive expected gain can be preserved under certain conditions.

Proposes a method to quantify and decompose disparity in ML models, separating exempt and non-exempt components.

problem Quantifying disparity in ML models, especially when certain features are exempted due to their critical importance.
method Information-theoretic decomposition into exempt and non-exempt components, satisfying desirable properties.
result Proposes a measure of non-exempt disparity that satisfies all desirable properties, and shows impossibility results for observational measures.

The paper proposes a model reward scheme for collaborative ML based on Shapley value and information gain.

problem Designing fair incentives for collaborative machine learning.
method The paper proposes a reward scheme based on Shapley value and information gain, with properties like fairness and stability.
result The proposed reward scheme satisfies fairness and trade-offs between desirable properties via an adjustable parameter.

This thesis was motivated by a desire to understand the natural geometry of hyperbolic monopole moduli spaces. We take two approaches. Firstly we develop the twistor theory of singular hyperbolic monopoles and use it to study the geometry of their charge 1 moduli spaces. After this we introduce a new way to study the m…

2006-10-09abs ↗pdf ↗

Sharp statistical theory for conditional diffusion models.

problem Lack of theoretical foundation for conditional diffusion models.
method Sharp statistical theory with approximation of conditional score function.
result Sample complexity bound that adapts to data distribution smoothness.

Paper presents a framework for learning generative models with structured latent factors.

problem Learning controllable and generalizable representations of multivariate data with desired structural properties.
method The paper introduces a novel generative model framework that uses mask variables to model dependency structure and extends the multivariate information bottleneck theory.
result The framework learns semantically meaningful latent factors that reflect various desired structures and can automatically estimate dependency structure from data.

This paper introduces localized discrepancy theories for unsupervised domain adaptation.

problem Improving generalization bounds for unsupervised domain adaptation.
method Localized discrepancies defined on the hypothesis space after localization, leading to smaller and asymmetric values.
result Improved generalization bounds and sample complexity reduction.

We use the 3d-3d correspondence together with the DGG construction of theories Tn[M]T_n[M] labelled by 3-manifolds M to define a non-perturbative state-integral model for SL(n,C) Chern-Simons theory at any level k, based on ideal triangulations. The resulting partition functions generalize a widely studied k=1 state-integ…

2014-09-02abs ↗pdf ↗

OptiGAN uses GAN and RL to optimize sequence generation for specific goals.

problem Challenging in sequence generation tasks to generate sequences with specific desired goals.
method Integrates GAN and RL to optimize desired goal scores using policy gradients.
result Achieves higher desired scores in text and real-valued sequence generation.

New algorithms recover Brenier potentials with desired smoothness and convexity.

problem Estimating Wasserstein distances between high-dimensional densities is computationally expensive and suffers from the curse of dimensionality.
method Propose algorithms to recover Brenier potentials that are strongly convex and smooth, solving a convex QCQP and a discrete OT problem alternately.
result Recover nearly optimal transport maps with small distortion using regularity as a regularization tool.

We show through theory and experiment that gradient-based explanations of a model quickly reveal the model itself. Our results speak to a tension between the desire to keep a proprietary model secret and the ability to offer model explanations. On the theoretical side, we give an algorithm that provably learns a two-la…

2018-07-13abs ↗pdf ↗

We present a new method for the separation of superimposed, independent, auto-correlated components from noisy multi-channel measurement. The presented method simultaneously reconstructs and separates the components, taking all channels into account and thereby increases the effective signal-to-noise ratio considerably…

2017-05-05abs ↗pdf ↗

Classical mean-variance portfolio theory tells us how to construct a portfolio of assets which has the greatest expected return for a given level of return volatility. Utility theory then allows an investor to choose the point along this efficient frontier which optimally balances her desire for excess expected return …

2009-08-11abs ↗pdf ↗

In this article, we prove that on any compact spin manifold of dimension m congruent 0,6,7 mod 8, there exists a metric, for which the associated Dirac operator has at least one eigenvalue of multiplicity at least two. We prove this by catching the desired metric in a subspace of Riemannian metrics with a loop that is …

2015-04-04abs ↗pdf ↗

Motivated by strong desire to understand the natural geometry of moduli spaces of hyperbolic monopoles, we introduce and study a new type of geometry: pluricomplex geometry. It is a generalisation of hypercomplex geometry: we still have a 2-sphere of complex structures, but they no longer behave like unit imaginary qua…

2011-04-12abs ↗pdf ↗

A new method combines classifiers using possibility distributions and adaptive t-norms.

problem Aggregating predictions from multiple classifiers trained on overlapping datasets.
method Proposes a new approach to aggregate classifier predictions using possibility theory and adaptive t-norms.
result Proves the proposed approach possesses desirable robustness properties.