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

229457686914 · Jun 202019922001200920172026
48 results for splitting problems

SPlit optimizes dataset splitting for better model performance.

problem Improving model performance through optimal dataset splitting.
method Adapting Support Points (SP) algorithm for subsampling and categorical variables in a sequential nearest neighbor approach.
result SPlit significantly improves worst-case testing performance compared to random splitting.

Optimizes decision-making with uncertain variables using auxiliary observations.

problem Contextual stochastic optimization problems with uncertain variables and rich auxiliary observations.
method Trains forest decision policies by growing trees that optimize downstream decision quality, using optimization perturbation analysis for efficient approximations.
result Proves asymptotic optimality and empirical validation of the method's performance and efficiency.

Novel methods for splitting Gaussian mixtures improve uncertainty propagation in nonlinear systems.

problem Improving accuracy and efficiency in nonlinear uncertainty propagation.
method Preserving mean and covariance, novel heuristics for selecting splitting direction informed by initial uncertainty and nonlinear function properties.
result Improved accuracy and efficiency in uncertainty propagation compared to existing techniques.

The classical multi-set split feasibility problem seeks a point in the intersection of finitely many closed convex domain constraints, whose image under a linear mapping also lies in the intersection of finitely many closed convex range constraints. Split feasibility generalizes important inverse problems including con…

2016-12-16abs ↗pdf ↗

Financial derivatives pricing aims to find the fair value of a financial contract on an underlying asset. Here we consider option pricing in the partial differential equations framework. The contemporary models lead to one-dimensional or multidimensional parabolic problems of the convection-diffusion type and generaliz…

2015-04-04abs ↗pdf ↗

It is a classical result that any complex analytic Lie supergroup G\mathcal{G} is split \cite{kosz}, that is its structure sheaf is isomorphic to the structure sheaf of a certain vector bundle. However, there do exist non-split complex analytic homogeneous supermanifolds. We study the question how to find out whether …

2012-06-29abs ↗pdf ↗

Develops formal moduli theory for splitting complex supermanifolds.

problem Tackles the splitting problem of complex supermanifolds.
method Constructs a filtered dg Lie algebra to control splittings and transfers the theory to a minimal filtered LL_\infty-model.
result Recover classical obstruction classes as leading terms of Maurer-Cartan representatives and proves the existence of higher obstructions.

Novel approach for creating interpretable classifiers using bilevel optimization of split-rules in NLDTs.

problem Creating highly accurate and easily interpretable classifiers for practical applications.
method Representing classifiers as assemblies of simple mathematical rules using NLDTs with evolutionary bilevel optimization.
result The approach ensures interpretability while achieving high accuracy on various classification problems.

The long standing classification problem in the theory of Heegaard splittings of 3-manifolds is to exhibit for each closed 3-manifold a complete list, without duplication, of all its irreducible Heegaard surfaces, up to isotopy. We solve this problem for non Haken hyperbolic 3-manifolds.

2015-09-19abs ↗pdf ↗

Study evaluates when splitting classifiers can improve performance despite disparate treatment.

problem Impact of disparate treatment in classification models.
method Comparison of split classifiers and group-blind classifiers, quantifying performance improvement.
result Proves an equivalent expression for the benefit-of-splitting which can be efficiently computed.

These are problems on Heegaard splittings, that were raised at the Workshop, listed according to their contributors: David Bachman, Mario Eudave-Munoz, John Hempel, Tao Li, Yair Minsky, Yoav Moriah and Richard Weidmann. On pages 285-298 of this monograph (arxiv:0904.0017) Hyam Rubinstein gives a personal collection of …

2009-04-01abs ↗pdf ↗

Study rigidity of spectral gap on Finsler manifolds with specific curvature bounds.

problem Rigidity of spectral gap on Finsler manifolds with Ricci curvature bound.
method Analysis of spectral gap, splitting phenomena, and needle decomposition.
result Rigidity results for spectral gap, logarithmic Sobolev, and Bakry-Ledoux inequalities.

New split rules improve subpopulation targeting in policy-making.

problem Improving binary classification for subpopulation targeting in policy-making.
method MDFS, PFS, wEFS for maximizing distance and penalizing final splits.
result Proposed methods target more vulnerable subpopulations than classic CART/KD-CART.

Optimizes data splitting for shorter conformal prediction intervals.

problem Minimizing prediction interval length while maintaining coverage.
method Theoretical framework for optimal data splitting in split conformal prediction.
result Analytical characterizations of length-optimal split ratios in various settings.

Geroch's theorem about the splitting of globally hyperbolic spacetimes is a central result in global Lorentzian Geometry. Nevertheless, this result was obtained at a topological level, and the possibility to obtain a metric (or, at least, smooth) version has been controversial since its publication in 1970. In fact, th…

2004-04-20abs ↗pdf ↗

A method to split a data point into two parts that individually cannot reconstruct the whole, but together can.

problem Splitting a single data point into two parts such that neither can reconstruct the whole but together can.
method Borrowing ideas from Bayesian inference to achieve a continuous analog of data splitting.
result A method to achieve data fission, enabling post-selection inference in finite samples.

In-network learning outperforms Federated and Split learning in wireless networks.

problem Efficiently using distributed features for inference in wireless networks.
method Proposes 'in-network learning' architecture, uses neural networks for optimization, compares with Federated and Split learning.
result In-network learning offers better accuracy and bandwidth savings.

This paper optimizes high-dimensional oblique splits for decision trees, enhancing performance and computational efficiency.

problem Enhancing decision tree performance and computational efficiency in high-dimensional data.
method Established Sufficient Impurity Decrease (SID) convergence for s0s_0-sparse oblique splits, proposing progressive trees for iterative refinement.
result Demonstrated that SID function class expands with s0s_0-sparsity, enabling capture of complex data-generating processes.

Study shows that splitting links requires an arbitrarily large number of extra crossings.

problem The problem is to determine the minimum number of extra crossings needed to transform a diagram of a split link into a split diagram.
method The approach uses Reidemeister moves and the framework of bubble tangles, along with techniques from Riemannian geometry.
result There exist split links with diagrams requiring an arbitrarily large number of extra crossings.

Develops a new inference method for split-sample estimators using multiple splits.

problem Statistical dependence and variability in split-sample estimators.
method Averaging across multiple splits, proving a central limit theorem, and developing new inference approaches.
result Valid confidence intervals and improved power in comparing model performance.

Develops variance-reduced methods for solving generalized equations.

problem Solving a class of generalized equations, including minimization, minimax, and variational inequalities.
method Integrates accelerated operator splitting, fixed-point methods, and variance reduction techniques.
result Achieves both O(1/k2)\mathcal{O}(1/k^2) and o(1/k2)o(1/k^2) convergence rates on the expected squared norm of the FBS residual.

We enhance the analogy between field extensions and covering spaces by introducing the concept of splitting covering which correspondences to the splitting field in Galois theory. We define semi-topological Galois groups for Weierstrass polynomials and prove the existence of a Galois correspondence. This new tool enabl…

2010-06-07abs ↗pdf ↗

This paper deals with the numerical approximation of American-style option values governed by partial differential complementarity problems. For a variety of one- and two-asset American options we investigate by ample numerical experiments the temporal convergence behaviour of three modern splitting methods: the explic…

2016-10-30abs ↗pdf ↗

Within the unmanageably large class of nonconvex optimization, we consider the rich subclass of nonsmooth problems that have composite objectives---this already includes the extensively studied convex, composite objective problems as a special case. For this subclass, we introduce a powerful, new framework that permits…

2011-09-01abs ↗pdf ↗

The problem of splitting a homotopy equivalence along a submanifold is closely related to the surgery exact sequence and to the problem of surgery of manifold pairs. In classical surgery theory there exist two approaches to surgery in the category of manifolds with boundaries. In the rel rel \partial case the surgery on…

2006-08-29abs ↗pdf ↗

One purpose of this article is to draw attention to the seminal work of J. Mealy in 1989 on calibrations in semi-riemannian geometry where split SLAG geometry was first introduced. The natural setting is provided by doing geometry with the complex numbers C replaced by the double numbers D, where i with i^2 = -1 is rep…

2010-07-02abs ↗pdf ↗

Let M_1 and M_2 be closed, orientable 3-manifolds. Let H_i denote a Heegaard surface in M_i. We prove that if H_1 # H_2 comes from stabilizing a lower genus splitting of M_1 # M_2 then either H_1 or H_2 comes from stabilizing a lower genus splitting. If H_i and G_i are non-isotopic Heegaard surfaces in M_i, and H_i is …

2004-04-03abs ↗pdf ↗

To reduce the label complexity in Agnostic Active Learning (A^2 algorithm), volume-splitting splits the hypothesis edges to reduce the Vapnik-Chervonenkis (VC) dimension in version space. However, the effectiveness of volume-splitting critically depends on the initial hypothesis and this problem is also known as target…

2018-09-28abs ↗pdf ↗

Co-Clustering, the problem of simultaneously identifying clusters across multiple aspects of a data set, is a natural generalization of clustering to higher-order structured data. Recent convex formulations of bi-clustering and tensor co-clustering, which shrink estimated centroids together using a convex fusion penalt…

2019-01-18abs ↗pdf ↗