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

111223334445 · Jun 202019922001200920172026
48 results for additive assumption

Thompson Sampling with bilateral uncertainty improves performance in Bayesian Optimization.

problem Twin difficulties of modeling and searching complex functions in high dimensions.
method Exploiting conditional independence, Thompson Sampling respecting bilateral uncertainty (BU).
result Thompson Sampling with BU is more effective than the additive approximation in small budgets.

Ancient solutions to Ricci flow on torus bundles have additional symmetries.

problem Understanding collapsed ancient solutions to the Ricci flow on compact manifolds.
method Algebraic and tameness assumptions on collapsing directions to prove additional torus symmetries.
result Ancient solutions to the Ricci flow on torus bundles converge to an Einstein metric on the base.

Study finds rigidity of biconservative hypersurfaces in space forms without curvature assumptions.

problem Investigating biconservative hypersurfaces in space forms without scalar curvature assumptions.
method Introduced a novel divergence-free tensor to derive results without curvature assumptions.
result Rigidity results for biconservative hypersurfaces in space forms without scalar curvature assumptions.

New proof removes decay assumptions for spacetime positive mass theorem.

problem Proving the rigidity of the spacetime positive mass theorem without additional decay assumptions.
method Uses spacetime harmonic functions and Liouville's theorem, and an alternative proof based on Killing development.
result Removes additional decay assumptions for the spacetime positive mass theorem.

This paper analyzes the convergence of Federated Average under relaxed assumptions.

problem Lack of theoretical analysis for Federated Average under assumptions beyond smoothness.
method Relaxing assumptions of strong smoothness to semi-smoothness and semi-Lipschitz properties, and introducing a bound on the gradient.
result Provides a theoretical convergence study on Federated Learning under new assumptions.

v2: An additional assumption was added in Theorem 4.8. In order to show that a connected abelian group is admissible on the site of locally compact spaces we must in addition assume that it is locally topologically divisible. This condition is used in the proof of Lemma 4.62.

2007-01-15abs ↗pdf ↗

The paper clarifies the distinction between CATE and ITE under ignorability assumptions.

problem Confusion between CATE and ITE hinders personalized effect estimation.
method Clarifies the distinction between CATE and ITE under ignorability assumptions.
result CATE and ITE are not necessarily the same under ignorability assumptions.

Frölicher spaces form a cartesian closed category which contains the category of smooth manifolds as a full subcategory. Therefore, mapping groups such as C^\infty(M,G) or \Diff(M), but also projective limits of Lie groups are in a natural way objects of that category, and group operations are morphisms in the category…

2009-06-24abs ↗pdf ↗

Improved Bayesian optimization for conditional parameter spaces.

problem Efficient global optimization of expensive-to-evaluate functions in conditional parameter spaces.
method Additive tree-structured covariance function for conditional parameter optimization.
result Significantly improved sample-efficiency and wider applicability compared to existing methods.

Theoretical analysis of deep neural networks for time series data.

problem Theoretical development for deep neural networks on temporally dependent observations is lacking.
method Established non-asymptotic bounds for prediction error of deep neural networks under mixing-type assumptions.
result Deep neural networks can model non-linear time series data with additional logarithmic factors due to dependence.

We propose a flexible method for estimating value functions in reinforcement learning without parametric assumptions.

problem Lack of interpretability in reinforcement learning models, especially in healthcare applications.
method Nonparametric additive model using local kernel regression and basis expansion.
result Personalized, adaptive recommendations for postoperative recovery.

Novel covariance function improves Bayesian optimization efficiency.

problem Efficient global optimization of expensive black-box functions.
method Additive tree-structured covariance function and parallel optimization algorithm.
result Significantly outperforms state-of-the-art methods in conditional parameter optimization.

Sparse additive modeling is a class of effective methods for performing high-dimensional nonparametric regression. In this work we show how shape constraints such as convexity/concavity and their extensions, can be integrated into additive models. The proposed sparse difference of convex additive models (SDCAM) can est…

2017-05-01abs ↗pdf ↗

You are a financial analyst. At the beginning of every week, you are able to rank every pair of stochastic processes starting from that week up to the horizon. Suppose that two processes are equal at the beginning of the week. Your ranking procedure is time consistent if the ranking does not change between this week an…

2017-11-23abs ↗pdf ↗

New assumptions and algorithm solve offline two-player zero-sum Markov games.

problem Solving offline two-player zero-sum Markov games under insufficient assumptions.
method Proposed unilateral concentration assumption and pessimism-type algorithm.
result Algorithm efficiently learns Nash equilibrium under unilateral concentration.

Generalizes Hoeffding's decomposition for dependent inputs under mild conditions.

problem Performing global sensitivity analysis on black-box models with dependent inputs.
method Proposes a novel framework based on probability theory, functional analysis, and combinatorics to handle dependencies.
result Any square-integrable, real-valued function of random elements with mild dependence assumptions can be uniquely additively decomposed.

In machine learning and data mining, linear models have been widely used to model the response as parametric linear functions of the predictors. To relax such stringent assumptions made by parametric linear models, additive models consider the response to be a summation of unknown transformations applied on the predict…

2017-10-16abs ↗pdf ↗

Under a convexity assumption on the boundary we solve a local inverse problem, namely we show that the geodesic X-ray transform can be inverted locally in a stable manner; one even has a reconstruction formula. We also show that under an assumption on the existence of a global foliation by strictly convex hypersurfaces…

2012-10-07abs ↗pdf ↗

The paper generalizes rigidity results for contact Anosov flows with bunching assumption.

problem Rigidity of contact Anosov flows in higher dimensions.
method Application of matching functions technique with bunching assumption.
result If two contact Anosov flows are C0C^0 conjugate, they are CrC^{r} conjugate for some r[1,2)r \in [1,2) or even CC^\infty conjugate under additional assumptions.

New analysis improves sample complexity for vanilla policy gradient methods.

problem Improving sample complexity guarantees for vanilla policy gradient methods.
method Adapting tools from SGD analysis to policy gradient methods, with smoothness and gradient approximation assumptions.
result Established improved sample complexity bounds for convergence and global optimum.

We prove that Riemannian foliations on complete contractible manifolds have a closed leaf, and that all leaves are closed if one closed leaf has a finitely generated fundamental group. Under additional topological or geometric assumptions we prove that the foliation is also simple.

2013-09-08abs ↗pdf ↗

It is observed that for complex surfaces, the positivity of the Ricci curvature is preserved by the Kähler-Ricci flow, under the additional assumption that the sum of the two lowest eigenvalues of the traceless curvature operator is non-negative.

2004-07-13abs ↗pdf ↗

Sparse generalized additive models (GAMs) are an extension of sparse generalized linear models which allow a model's prediction to vary non-linearly with an input variable. This enables the data analyst build more accurate models, especially when the linearity assumption is known to be a poor approximation of reality. …

2019-12-04abs ↗pdf ↗

First order discretizations of Langevin diffusion can achieve better generalization error with additional smoothness assumptions.

problem Analyzing generalization error for first order discretizations of Langevin diffusion.
method Providing a sufficient smoothness condition to show that first order methods can achieve arbitrarily runtime complexity for a given expected generalization error.
result First order methods can achieve arbitrarily runtime complexity with additional smoothness assumptions.

Conformal prediction is a method of producing prediction sets that can be applied on top of a wide range of prediction algorithms. The method has a guaranteed coverage probability under the standard IID assumption regardless of whether the assumptions (often considerably more restrictive) of the underlying algorithm ar…

2014-04-08abs ↗pdf ↗

Solves Dirichlet problem for specific PSH functions on Hermitian manifolds.

problem Solving Dirichlet problem for Monge-Ampère equation for (n1)(n-1)-PSH functions.
method Deriving a quantitative boundary estimate under (n1)(n-1)-PSH subsolutions assumption.
result Quantitative boundary estimate confirmed for specific manifolds.

Neural model improves option pricing by calibrating additive process term structure.

problem Calibrating additive process models for option pricing with time-dependent parameters.
method Proposes neural term structure model using feedforward neural networks to represent term structure.
result Improves option pricing accuracy with neural term structure model.

The paper finds closed hypersurfaces with prescribed mean curvature in non-compact manifolds.

problem Finding closed hypersurfaces with prescribed mean curvature in non-compact manifolds.
method One-parameter prescribed mean curvature min-max theory.
result Closed hypersurfaces with prescribed mean curvature are found in certain non-compact manifolds.

New study shows exponential lower bound for RL even with constant suboptimality gap.

problem Can RL be sample-efficient with a constant suboptimality gap?
method Analyzes reinforcement learning in the online setting with a linearly realizable optimal Q-function.
result An exponential sample complexity lower bound still holds even with a constant suboptimality gap.

Study of elliptic boundary value problems on non-compact manifolds.

problem Analyzing elliptic differential operators on manifolds with non-compact boundaries.
method Regularity theory and trace theorems for sections in the maximal domain under various assumptions.
result Systematic study of local and nonlocal boundary conditions, including the Atiyah-Patodi-Singer condition.

In this paper, we study a complete noncompact nonnegatively curved Alexandrov space AA with a soul SS of codimension two. We establish some structural results under additional regularity assumptions. As an application, we conclude that in this case Sharafutdinov retraction, π: ASπ:\ A\to S, is a submetry.

2013-01-07abs ↗pdf ↗

The paper shows that relaxing assumptions about causal graphs can lead to exponentially large equivalence classes.

problem The size of Markov equivalence classes under relaxed assumptions.
method Analytical proofs for three settings: sparse random directed acyclic graphs, uniformly random acyclic directed mixed graphs, and uniformly random directed cyclic graphs.
result Exponentially large lower bounds for the expected size of Markov equivalence classes.

We introduce and motivate a notion of pseudo-arithmeticity, which possibly applies to all lattices in PO(n,1)\mathrm{PO}(n,1) with n>3n>3. We further show that under an additional assumption (satisfied in all known cases), the covolumes of these lattices correspond to rational linear combinations of special values of LL-fun…

2018-10-30abs ↗pdf ↗

By extending Koiso's examples to the non-compact case, we construct complete gradient Kahler-Ricci solitons of various types on certain holomorphic line bundles over compact Kahler-Einstein manifolds. Moreover, a uniformization result on steady gradient Kahler-Ricci solitons with non-negative Ricci curvature is obtaine…

2008-02-04abs ↗pdf ↗