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

69138207276 · Jun 202019922001200920172026
48 results for domain splitting

IMPaCT improves node classification in chronological split temporal graphs.

problem Domain adaptation challenges in graph data due to chronological splits.
method IMPaCT proposes a method to impose invariant properties based on realistic assumptions derived from temporal graph structures.
result IMPaCT achieves a 3.8% performance improvement over current SOTA method on the ogbn-mag graph dataset.

SBAMDT uses adaptive soft splits to model complex decision boundaries.

problem Limited ability of standard decision trees to capture complex decision boundaries.
method Probabilistic additive decision tree model with adaptive soft multivariate splits.
result Demonstrated improved predictive performance on synthetic and real datasets.

Paper establishes a new formula for Atiyah-Patodi-Singer index using eta invariants.

problem Calculating the Atiyah-Patodi-Singer index without invertibility of boundary operator.
method Using an asymptotic gluing formula for eta invariants and a splitting principle.
result Formula expressing index in terms of eta invariants of domain-wall massive Dirac operators.

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.

The paper explores how splitting data samples influences optimal neural network hyperparameters.

problem Understanding the effectiveness of neural networks and their hyperparameters.
method Investigates the role of sample splitting in neural network hyperparameter selection.
result Optimal hyperparameters derived from sample splitting lead to a neural network model that minimizes prediction risk asymptotically.

We provide monotonicity formulas for solutions to the p-Laplace equation defined in the exterior of a convex domain. A number of analytic and geometric consequences are derived, including the classical Minkowski inequality as well as new characterizations of rotationally symmetric solutions and domains. The proofs rely…

2018-03-28abs ↗pdf ↗

New method embeds phylogenetic trees for clustering, recovering evolutionary relationships.

problem Lack of a meaningful way to embed phylogenetic trees into a vector space.
method Split-weight embedding to fit clustering algorithms to phylogenetic trees.
result Split-weight embedding recovers meaningful evolutionary relationships in simulated and real data.

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 ↗

Let ΓΓ be a one-ended, torsion-free hyperbolic group and let GG be a semisimple Lie group with finite center. Using the canonical JSJ splitting due to Sela, we define amalgam Anosov representations of ΓΓ into GG and prove that they form a domain of discontinuity for the action of Out(Γ)\mathrm{Out}(Γ). In the appendix,…

2014-11-09abs ↗pdf ↗

The energy of any C1C^1 representative of a homotopy class of maps from a compact and connected Riemannian manifold with nonnegative Ricci curvature into a complete Riemannian manifold with no conjugate points is bounded below by a constant determined by the asymptotic geometry of the target, with equality if and only …

2018-05-20abs ↗pdf ↗

Gradient bounds and Liouville theorems for quasi-linear equations on manifolds with nonnegative Ricci curvature.

problem Establishing bounds and theorems for solutions to quasi-linear elliptic equations on compact manifolds with nonnegative Ricci curvature.
method Gradient bounds, Liouville-type theorems, local splitting theorem, Harnack-type inequality, ABP estimate.
result Gradient bounds and Liouville-type theorems for solutions to quasi-linear equations on compact manifolds with nonnegative Ricci curvature.

Study classifies graphs in Euclidean and non-Euclidean spaces with specific curvature conditions.

problem Classifying graphs with prescribed curvature in various spaces.
method Proves rigidity and classification results for graphs in Riemannian manifolds, focusing on R2\mathbb{R}^2 and R3\mathbb{R}^3.
result Provides general splitting theorems for graphs in these settings.

New method estimates individual treatment effects using domain generalization.

problem Estimating causal individual treatment effects from observational data with treatment bias.
method Invariant Risk Minimization (IRM) framework to learn predictors invariant to domain-dependent factors.
result IRM-based ITE estimator shows gains over classical regression approaches in settings with pronounced support mismatch.

The paper introduces a method to control false splits in tree-based data aggregation.

problem Identifying the correct subgroups to treat as a single entity in tree-based data.
method Introduces the 'false split rate' and proposes a multiple hypothesis testing algorithm for tree-based aggregation.
result The proposed algorithm controls the false split rate, demonstrating its effectiveness on stock volatility and taxi fare data.

A new method for predicting insurance claims with statistical guarantees.

problem Creating accurate prediction intervals for insurance claims.
method Model-agnostic framework using split conformal prediction for frequency-severity modeling.
result Shows effectiveness on simulated and real datasets using various models.

Quantized-TinyLLaVA reduces communication costs in split learning for multimodal models.

problem High communication costs in split learning for multimodal models.
method Integrates a compression module that quantizes intermediate features into discrete representations before transmission.
result Achieves an approximate 87.5% reduction in communication overhead with 2-bit quantization.

Optimal transport aims to estimate a transportation plan that minimizes a displacement cost. This is realized by optimizing the scalar product between the sought plan and the given cost, over the space of doubly stochastic matrices. When the entropy regularization is added to the problem, the transportation plan can be…

2019-09-20abs ↗pdf ↗

We introduce O-systems (Definition \ref{DO}) of orthogonal transformations of Rm{\Bbb R}^{m}, and establish 111-1 correspondences both between equivalence classes of Clifford systems and that of O-systems, and between O-systems and orthogonal multiplications of the form $μ:{\Bbb R}^{n} \times {\Bbb R}^{m} \longrightarr…

1995-11-03abs ↗pdf ↗

Enhances Random Forest for imbalanced functional data classification.

problem Challenges in classifying imbalanced functional data.
method Functional Random Forest with Adaptive Cost-Sensitive Splitting (FRF-ACS).
result Significantly improves minority class recall and predictive performance.

New invariant defined for Weinstein domains, related to Kirby-Thompson's invariant.

problem Defining a symplectic invariant for Weinstein domains.
method Contact cut graph, Lefschetz fibrations, multisections with divides.
result Definition of Weinstein L\mathcal{L}-invariant and its relation to Kirby-Thompson's invariant.

Tree-based algorithm for functional data analysis reduces generalization error.

problem Classification and regression problems with functional data.
method Constrained convex optimization for weighted functional L2L^{2} space, multiple splitting rules, and weighted integral features.
result Reduces generalization error while maintaining interpretability.

Proposes a framework for semi-supervised continual learning from sequentially arriving data.

problem Learning from data with changing task distribution over time, especially in domains with a mix of labeled and unlabeled data.
method Meta-Consolidation for Continual Semi-Supervised Learning (MCSSL) framework with a hypernetwork and semi-supervised auxiliary classifier.
result Significant improvements in continual semi-supervised learning setting.

We consider a curve of Fredholm pairs of Lagrangian subspaces in a fixed Banach space with continuously varying (weak) symplectic structures. Assuming vanishing index, we obtain intrinsically a continuously varying splitting of the total Banach space into pairs of symplectic subspaces. Using such decompositions we defi…

2014-06-03abs ↗pdf ↗

CMCO provides robust uncertainty estimates for neural operators without retraining.

problem Uncertainty quantification in deep learning for real-time virtual sensing.
method Unified Monte Carlo dropout and split conformal prediction in DeepONet.
result Near-nominal empirical coverage in diverse applications.

This paper computes fixed point Floer cohomology for Dehn twists on surfaces.

problem Computing fixed point Floer cohomology for Dehn twists.
method Developed tools for computing fixed point Floer cohomology and product for Dehn twists in all dimensions.
result Splitting of the product and differential into local and Morse-theoretic contributions.

We prove that a compact RCD(0,N)RCD^*(0,N) (or equivalently RCD(0,N)RCD(0,N)) metric measure space, (X,d,m)\left(X, d, m \right), with $\diam X \le d$ and its first (nonzero) eigenvalue of the Laplacian (in the sense of Ambrosio-Gigli-Savaré) , λ1=π2d2λ_1 = \frac{π^2}{d^2}, has to be a circle or a line segment with diameter, ππ. This compl…

2015-06-16abs ↗pdf ↗

Transfer learning is a popular practice in deep neural networks, but fine-tuning of large number of parameters is a hard task due to the complex wiring of neurons between splitting layers and imbalance distributions of data in pretrained and transferred domains. The reconstruction of the original wiring for the target …

2017-10-20abs ↗pdf ↗

Data representations that contain all the information about target variables but are invariant to nuisance factors benefit supervised learning algorithms by preventing them from learning associations between these factors and the targets, thus reducing overfitting. We present a novel unsupervised invariance induction f…

2018-09-26abs ↗pdf ↗

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.

The paper extends keenness concept to bridge splittings and finds conditions for existence.

problem Extending keenness concept to bridge splittings and finding conditions for existence.
method Extending the concept of keenness to bridge splittings and proving existence conditions.
result Existence of strongly keen (g,b)(g,b)-splitting of a link with distance nn for certain integers gg, bb, and nn.

Non-split almost complex supermanifolds and non-split Riemannian supermanifolds are studied. The first obstacle for a splitting is parametrized by group orbits on an infinite dimensional vector space. Further it is shown that non-split structures appear in the first case as deformations of a split reduction and in the …

2015-01-28abs ↗pdf ↗

We study the self-dual Yang-Mills equations in split signature. We give a special solution, called the basic split instanton, and describe the ADHM construction in the split signature. Moreover a split version of t'Hooft ansatz is described.

2009-02-03abs ↗pdf ↗

BERT models can classify multilingual party manifestos across different dimensions.

problem Costly manual annotation of large corpora in social science.
method Domain transfer across geographical locations, languages, time, and genre using fine-tuned transformer models.
result BERT models can be applied to future data with similar performance.

Paper proposes a novel SVM method for creating survival trees.

problem Creating non-linear survival trees for right-censored data.
method L2-regularized dipole splitting criteria with kernel methods.
result Non-linear splits using polynomial and Gaussian kernels show similar predictive power but often smaller tree sizes.

In this paper we provide a new method for establishing the rotational symmetry of the solutions to a couple of very classical overdetermined problems arising in potential theory, in both the exterior and the interior punctured domain. Thanks to a conformal reformulation of the problems, we obtain Riemannian manifolds w…

2014-03-23abs ↗pdf ↗