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

90180269359 · Jun 202019922001200920172026
48 results for mixed derivatives

Unified Minkowski problem discussed for (p,q)-mixed quermassintegrals.

problem Unified Minkowski problem for (p,q)-mixed quermassintegrals.
method Introducing (p,q)-mixed quermassintegrals and (p,q)-dual mixed curvature measure to study the Minkowski problem.
result Derivation of important properties and geometric inequalities for (p,q)-mixed quermassintegrals.

Study on gradient descent in Hilbert spaces with Markov chains, focusing on mixing coefficients.

problem Analyzing convergence of gradient descent in Hilbert spaces with stationary Markov chains.
method Examined strictly stationary Markov chains with φφ- and ββ-mixing coefficients, derived probabilistic upper bounds.
result Probabilistic upper bounds on convergence behavior of gradient descent algorithm based on mixing coefficients.

This work improves mixing rates for Bayesian CART, a key component of BART.

problem Understanding and improving mixing rates for Bayesian inference with MCMC.
method Derived upper bounds on mixing times, provided sufficient conditions for polynomial mixing, and proposed Twiggy Bayesian CART.
result Twiggy Bayesian CART achieves polynomial mixing without assuming signal connectivity.

We give a simple optimistic algorithm for which it is easy to derive regret bounds of O~(tmixSAT)\tilde{O}(\sqrt{t_{\rm mix} SAT}) after TT steps in uniformly ergodic Markov decision processes with SS states, AA actions, and mixing time parameter tmixt_{\rm mix}. These bounds are the first regret bounds in the general, non-epi…

2018-08-06abs ↗pdf ↗

New framework relaxes independence assumption for graph-mixing dependencies.

problem Tackles limitations of existing generalization results for graph-mixing dependencies.
method Proposes a framework where dependencies decay with graph distance, derives generalization bounds leveraging online-to-PAC framework.
result Derives high-probability generalization guarantees that depend on mixing rate and graph's chromatic number.

We derive and analyze learning algorithms for apprenticeship learning, policy evaluation, and policy gradient for average reward criteria. Existing algorithms explicitly require an upper bound on the mixing time. In contrast, we build on ideas from Markov chain theory and derive sampling algorithms that do not require …

2019-05-23abs ↗pdf ↗

We consider the geodesic equation for the generalized Kahler potential with only mixed second derivatives bounded. We show that given such two generalized Kahler potentials, there is a unique geodesic segment such that for each point on the geodesic, the generalized Kahler potential has uniformly bounded mixed second d…

2012-08-05abs ↗pdf ↗

Study online learning in RKHS with dependent processes, focusing on \(β\)- and \(φ\)-mixing.

problem Online learning in RKHS with dependent data.
method Online regularized learning algorithm in RKHS, analyzing \(β\)- and \(φ\)-mixing sequences.
result Probabilistic upper bounds and convergence rates for mixing coefficients.

The mixed scalar curvature of a foliated Riemannian manifold, i.e., an averaged mixed sectional curvature, has been considered by several geometers. We explore the Yamabe type problem: to prescribe the constant mixed scalar curvature for a foliation by a conformal change of the metric in normal directions only. For a h…

2014-05-15abs ↗pdf ↗

Bayesian models that mix multiple Dirichlet prior parameters, called Multi-Dirichlet priors (MD) in this paper, are gaining popularity. Inferring mixing weights and parameters of mixed prior distributions seems tricky, as sums over Dirichlet parameters complicate the joint distribution of model parameters. This paper s…

2017-08-17abs ↗pdf ↗

The paper develops methods to derive mixed superposition rules for Lie systems and applies them to various physical systems.

problem Finding general solutions for Lie systems.
method Develops mixed superposition rules for Lie systems with imprimitive Lie algebras and semidirect sums.
result Extends coalgebra method to Lie systems of partial differential equations.

New method for conformal prediction under Markovian data reduces coverage gap.

problem Reducing coverage gap in conformal prediction for Markovian data.
method Split Conformal Prediction method adapted to Markovian data, with K-split CP for improved performance.
result Coverage gap typically scales as √(t_mix * ln(n) / n) for general Markov chains, and can be reduced to t_mix / (n * ln(n)) with K-split CP.

The paper explores the relationship between joint mixability and negative dependence structures.

problem Understanding the connection between joint mixability and various negative dependence concepts.
method Analyzes the properties of joint mixes and their relation to negative dependence structures.
result Derives necessary and sufficient conditions for a joint mix to be negatively dependent.

Bayesian optimisation tackles high-dimensional categorical and mixed search spaces.

problem Bayesian optimisation on high-dimensional categorical and mixed search spaces is challenging.
method Combining local optimisation with a tailored kernel design.
result Empirically outperforms current baselines in performance and computational costs.

Efficiently calibrates Bergomi models to VIX derivatives using vector quantization.

problem Calibrating Bergomi models to VIX derivatives for accurate pricing.
method Applied vector quantization in mixed Bergomi models for fast and efficient option pricing.
result Calibration of Bergomi models to VIX derivatives is feasible and accurate over daily data.

Develops a deep learning framework for various data types.

problem Handling nonparametric regression and classification across different data types.
method Introduces a general framework with two estimators: NPDNN and SPDNN, based on data satisfying generalized Bernstein-type inequalities.
result Both NPDNN and SPDNN estimators are minimax optimal in many classical settings.

The paper proposes methods for predicting missing values in mixed data matrices.

problem Matrix completion for mixed data types (continuous, binary, ordinal).
method Generalized latent factor models for low-rank matrix estimation with entrywise consistency.
result Tight probabilistic error bounds for the proposed estimators.

Unified Bayesian Optimisation for mixed variables improves performance.

problem Efficient optimisation of problems with both categorical and continuous variables.
method Derive value proposals from the Expected Improvement criterion to optimise both categorical and continuous variables under a single acquisition metric.
result Unified approach significantly outperforms existing methods across mixed-variable tasks.

In this paper, we give a new sharp generalization bound of lp-MKL which is a generalized framework of multiple kernel learning (MKL) and imposes lp-mixed-norm regularization instead of l1-mixed-norm regularization. We utilize localization techniques to obtain the sharp learning rate. The bound is characterized by the d…

2011-03-27abs ↗pdf ↗

Study geodesic equation on mixed-volume forms on balanced manifolds, proving existence of solutions.

problem Existence of solutions to the Calabi-Yau equation for balanced metrics.
method Introduced a L2L^2 metric space of mixed-volume forms and derived a geodesic equation.
result Existence of solutions to the Calabi-Yau equation on all balanced manifolds.

Paper extends nonparametric regression bounds for dependent β\beta-mixing samples.

problem Analyzing error in nonparametric regression with dependent data.
method Extends uniform deviation inequalities from independent to dependent β\beta-mixing samples.
result Derives generalization bounds for nonparametric regression with dependent data.

New method recovers causal DAGs from general environments without strict assumptions.

problem Recovering causal DAGs from real-world data with varying distributions.
method Formalizes desiderata for causal representation learning in general environments, leveraging sufficient change conditions up to third-order derivatives.
result Fully recovers latent DAG and identifies latent variables up to minor indeterminacies under nonparametric mixing.

New Krylov subspace methods speed up mixed-effects models with crossed random effects.

problem Slow computations for high-dimensional crossed random effects in mixed-effects models.
method Krylov subspace-based methods for generalized mixed-effects models with cross effects.
result Speedups by factors of up to 10,000 in computations for mixed-effects models.

Functional determinant for mixed signature sphere products depends on sphere dimensions and parity.

problem Determining the functional determinant for scalar fields on mixed signature sphere products.
method Analyzing the GJMS operator on Sqimes^q imesSp^p to derive the functional determinant.
result The functional determinant depends only on the total dimension and parity of the sphere dimensions.

Study pricing derivatives in markets with long-range dependence and jumps.

problem Deriving pricing formulas for derivatives in markets with long-range dependence and jumps.
method Developed a fractional integro-partial differential equation (PIDE) and used semigroup theory and finite-difference schemes for numerical solutions.
result Closed-form pricing formula for European options and numerical solution for general options.

New dg-algebras generalize Brauer graph algebras, with applications to stability conditions and quadratic differentials.

problem Generalizing Brauer graph algebras to new dg-algebras.
method Derived categories, mixed-angulations of surfaces, stability conditions, and quadratic differentials.
result Spaces of stability conditions on derived categories of these algebras are described in terms of spaces of quadratic differentials.

New model integrates community and link clustering for network data.

problem Lack of embedded prior information and community evolution description in MMSB.
method Fragmentation coagulation process for community and link clustering, with Gibbs sampling for inference.
result Model infers community structure and evolution, improving MMSB.

Paper analyzes Nyström regularization for time series forecasting with sequential sub-sampling.

problem Learning rate analysis of Nyström regularization for ττ-mixing time series.
method Banach-valued Bernstein inequality and integral operator approach for ττ-mixing sequences.
result Almost optimal learning rates for Nyström regularization with sequential sub-sampling.

The study explores mixed Killing vector fields on almost coKähler manifolds.

problem Characterizing mixed Killing vector fields on almost coKähler manifolds.
method Generalized Bochner's theorem for mixed Killing vector fields and studied in the context of almost coKähler structures.
result The Reeb vector field on an almost coKähler manifold is mixed Killing if and only if the operator h=0h=0.

A universal framework for constructing confidence sets using sequential likelihood mixing.

problem Constructing reliable confidence sets for realizable likelihood functions.
method Sequential likelihood mixing, integrating Bayesian inference and regret inequalities.
result Establishes fundamental connections and provable coverage guarantees for various inference techniques.

Method completes mixed matrix from complex surveys with heterogeneous missingness.

problem Recovering a mixed dataframe matrix from complex survey sampling with different missingness patterns.
method Two-stage procedure: logistic regression for missingness modeling, and weighted log-likelihood maximization with low-rank constraint.
result The proposed method achieves sublinear convergence and shows superior performance compared to existing methods.