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

100200299399 · Jun 202019922001200920172026
48 results for partial dependence

New concept of partial comonotonicity connects riskmetrics and dependence.

problem Understanding and quantifying risk metrics under partial comonotonicity.
method Developed a new notion of partial comonotonicity and established its connection to distortion riskmetrics.
result Partial comonotonicity uniquely characterizes a class of distortion riskmetrics through additivity.

Partial dependence curves (FPD) introduced by Friedman, are an important model interpretation tool, but are often not accessible to business analysts and scientists who typically lack the skills to choose, tune, and assess machine learning models. It is also common for the same partial dependence algorithm on the same …

2019-07-15abs ↗pdf ↗

Study optimal policy regret in partially observable Markov games with adaptive opponents.

problem Optimal sequential decision-making in partially observable environments against strategic, adaptive opponents.
method An epoch-based optimistic maximum-likelihood algorithm that selects one policy per epoch using confidence sets built cumulatively from past data.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) policy regret for fixed problem parameters, with explicit dependence on horizon, adversary memory, confidence radius, and aggregate Eluder dimension.

Study uses deep neural networks for inference in partially linear models with dependent data.

problem Inference in partially linear models with dependent data.
method First stage deep neural network (DNN) estimation followed by n\sqrt{n}-consistent and asymptotically normal estimator.
result The DNN-estimated finite dimensional parameter achieves n\sqrt{n}-consistency and asymptotic normality.

Study expands multiclass classification models with new rates and partial concept classes.

problem Multiclass classification with a bounded number of labels under various conditions.
method Extends traditional PAC model to distribution-dependent and data-dependent learning rates, characterizes optimal rates for universal and partial concept classes.
result Characterizes three types of learning rates (exponential, linear, arbitrarily slow) for fixed distributions and complexity measures for partial concept classes.

Let MM be a compact hypersurface with boundary M=D1D2\partial M=\partial D_1 \cup \partial D_2, D1Π1\partial D_1 \subset Π_1, D2Π2\partial D_2 \subset Π_2, Π1Π_1 and Π2Π_2 two parallel hyperplanes in Rn+1\mathbb{R}^{n+1} (n2n \geq 2). Suppose that MM is contained in the slab determined by these hyperplanes and that the mean cu…

2016-01-12abs ↗pdf ↗

PDGM uses neural nets to solve complex financial equations.

problem Solving path-dependent partial differential equations (PPDEs)
method Generalized Deep Galerkin Method (PDGM) combining feed-forward and LSTM architectures
result PDGM successfully models solutions to various PPDEs, including financial derivatives.

Derives derivatives and geometric framework for functions with non-independent variables.

problem Characterizing functions with non-independent variables in probabilistic models.
method Derives actual and dependent partial derivatives, dependent Jacobian matrix, and tensor metric.
result Derives gradient, Hessian, and Taylor expansion for functions with non-independent variables.

Researchers show how to manipulate Partial Dependence plots to deceive explanations of predictive models.

problem The robustness and trustworthiness of Partial Dependence (PD) explanations are compromised.
method Data poisoning using genetic and gradient algorithms to manipulate PD plots.
result PD explanations can be fooled and manipulated to mislead understanding of predictive models.

New algorithms improve privacy in bandit problems with partial information.

problem Privacy constraints in multi-armed bandit problems with partial reward information.
method Proposed a generic framework for designing εε-global DP extensions of UCB and KL-UCB algorithms.
result AdaP-KLUCB algorithm achieves optimal regret bound under εε-global DP constraints.

New model captures state-dependent variability in partially observed systems.

problem Structured stochasticity not captured by constant-variance models.
method State-coupled stochastic volatility framework with particle expectation-maximization.
result Model consistently reduces recovery bias under partial observation.

GADGET framework decomposes global feature effects using recursive partitioning.

problem Misleading global feature effects when feature interactions are present.
method Generalized additive decomposition of global effects (GADGET) based on recursive partitioning.
result Minimizes interaction-related heterogeneity of local feature effects.

New method identifies causal variables from partially observed data.

problem Learning from unpaired observations with instance-dependent partial observability.
method Proposes two methods enforcing sparsity in the inferred representation.
result Establishes two identifiability results for linear and piecewise linear mixing functions.

Probabilistic method combines space and time uncertainties in PDEs.

problem Separate treatment of space and time in PDE solvers obscures interactions and error quantification.
method Gaussian process interpretation of finite difference methods interacting with probabilistic ODE solvers.
result Joint quantification of space- and time-uncertainty possible without sacrificing ODE solver performance.

Let (M,g(t))(M, g(t)), t[0,T)t\in[0,T) be a closed Riemannian nn-manifold whose Riemannian metric g(t)g(t) evolves by the geometric flow tgij=2Sij \frac{\partial }{\partial t} g_{ij}=-2S_{ij} , where Sij(t)S_{ij}(t) is a symmetric two-tensor on (M,g(t))(M,g(t)). We discuss differential Harnack estimates for positive solution to the porous medium …

2019-01-30abs ↗pdf ↗

In this paper I develop a new computational method for pricing path dependent options. Using the path integral representation of the option price, I show that in general it is possible to perform analytically a partial averaging over the underlying risk-neutral diffusion process. This result greatly eases the computati…

2000-05-19abs ↗pdf ↗

New method controls linear systems with partial info and disturbances.

problem Controlling linear dynamical systems under partial observation and adversarial disturbances.
method Double Spectral Control (DSC) using two-level spectral approximation strategy.
result Matches best known regret guarantees with exponential runtime improvement.

New quantum algorithm simplifies complex financial derivatives pricing.

problem Complex financial derivatives pricing with high dimensionality.
method Quantum-inspired variational algorithms combined with neural-network quantum states.
result Simplified pricing of European options with many correlated assets.

Enhances reinforcement learning with partial state information.

problem Improving learning under partial observability with limited privileged signals.
method Introduced informed asymmetric actor-critic framework that uses arbitrary state-dependent privileged signals.
result Unbiased policy gradient estimates with arbitrary privileged signals.

Researchers formalize PD and PFI to relate them to data generating process.

problem Lack of theory linking PD and PFI to data generating process.
method Formalize PD and PFI as estimators of ground truth estimands, account for model variance with learner-PD and learner-PFI.
result PD and PFI estimates deviate from ground truth due to statistical biases, model variance, and Monte Carlo approximation errors.

Study on 44-dimensional almost-Hermitian manifolds, proving \overline\partial-harmonic forms invariant under certain metrics.

problem Proving \overline\partial-harmonic forms are topological invariants for specific metrics on 44-dimensional almost-Hermitian manifolds.
method Analyzing \overline\partial-Laplacian and using globally conformally Kähler and strictly locally conformally Kähler metrics.
result Dimension of \overline\partial-harmonic (1,1)(1,1)-forms is a topological invariant, answering Kodaira and Spencer's problem.

New findings on Malgrange-Galois groupoid for Painlevé VI equation parameters.

problem Understanding transformations preserving specific forms for Painlevé VI equation.
method Computed Malgrange-Galois groupoid for Painlevé VI family with all parameters.
result Solutions of Painlevé VI do not satisfy new partial differential equations.

In this paper, we prove that there exists a dimensional constant δ>0δ> 0 such that given any background Kähler metric ωω, the Calabi flow with initial data u0u_0 satisfying \begin{equation*} \partial \bar \partial u_0 \in L^\infty (M) \text{ and } (1- δ)ω< ω_{u_0} < (1+δ)ω, \end{equation*} admits a unique short time so…

2017-01-24abs ↗pdf ↗

A new method uses deep learning to efficiently solve complex physics equations in high dimensions.

problem Efficiently solving high-dimensional time-dependent PDEs with dynamic solutions.
method Deep adaptive sampling framework for PINNs extended to spacetime domains using normalizing flows.
result The method effectively identifies and tracks high-residual regions in both space and time.

A new approach uses partial likelihood to improve tree-based density estimation and inference.

problem Inference on tree-based models suffers from overfitting and reduced efficiency due to data-independent partitioning.
method Proposes a partial likelihood approach to data-dependent partitioning of tree-based models.
result Significant gains in estimation accuracy and computational efficiency from adopting partial likelihood.

We tackle linear bandits with partially observable features, achieving sublinear regret.

problem Linear regret due to unobserved features in partially observable linear bandits.
method Feature augmentation with orthogonal basis vectors and a doubly robust estimator.
result Sublinear regret bound of ildeO((d+dh)T) ilde{O}(\sqrt{(d + d_h)T}).

A new tree-based estimator, FastPD, efficiently estimates PD functions for machine learning models.

problem Efficiently estimating Partial Dependence functions for machine learning models.
method Proposes a new tree-based estimator, FastPD, to estimate PD functions.
result FastPD consistently estimates the desired population quantity and improves complexity from quadratic to linear.

The paper calculates MES bounds for systemic risk contributions under uncertain dependence.

problem Measuring systemic risk contributions of financial firms under uncertainty in dependence structure.
method Derives worst-case and best-case bounds for MES under known individual firm risks and partial dependence information.
result Improved MES bounds derived for various types of dependence models.

New Thompson sampling algorithm for stochastic partial monitoring achieves logarithmic regret.

problem Limited feedback in sequential learning problems.
method Developed a novel Thompson-sampling-based algorithm to sample from the posterior distribution exactly.
result Achieved logarithmic regret bound of O(log T) for a linearized variant of the problem.

This paper detects Markov violations in RL with noise, improving policy development.

problem Partial observability and sensor/actuator noise invalidate Markovian assumptions in RL.
method Combines PCMCI causal discovery with Markov Violation score (MVS).
result Even substantial noise doesn't always disrupt multi-step dependencies.

Homotopy equivalent boundaries of cube complexes are studied.

problem The equivalence of different boundaries of cube complexes.
method Using a partial order on a quotient of the Roller boundary, we obtain the simplicial Roller boundary and show homotopy equivalence among the Tits, simplicial, and simplicial Roller boundaries.
result The Tits, simplicial, and simplicial Roller boundaries are homotopy equivalent.