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

3907791,1691,558 · Jun 202019922001200920172026
48 results for Data Set Characteristics

This review discusses challenges and solutions for AI in chemical engineering.

problem Challenges in applying classical machine learning to chemical engineering data.
method Identifying four data characteristics and discussing their applications and solutions.
result Current research extends data science and machine learning to handle chemical engineering data challenges.

Proves stability of Minkowski space for specific initial data.

problem Stability of Minkowski space under spacelike-characteristic initial data.
method Vectorfield method and bootstrapping argument, with new geometric constructions.
result Global nonlinear stability of Minkowski space proved for the spacelike-characteristic Cauchy problem.

Survey on ML advances for personalized prediction considering entity characteristics.

problem Sub-optimal performance in personalized prediction due to heterogeneity in data across entities.
method Organized current literature on entity-aware modeling based on characteristics availability and training data amount.
result Recent innovations in uncertainty quantification, fairness, and knowledge-guided machine learning can improve entity-aware modeling.

Develops a dynamic latent-factor model for high-dimensional asset characteristics.

problem Estimating asset pricing tests with high-dimensional data.
method Dynamic latent-factor model with Double Selection Lasso regularization.
result The inflation-mimicking portfolio in the crypto asset class has positive risk compensation.

Study on 3D spacetimes, focusing on vacuum data and energy bounds.

problem Existence and properties of solutions for Einstein equations in 3D spacetimes.
method Analysis of 2D general relativistic initial data sets, construction of vacuum, spacelike data, and review of global Hamiltonian charges.
result Established lower bounds for energy in terms of angular momentum, linear momentum, and center of mass.

Imbalanced data sets containing much more background than signal instances are very common in particle physics, and will also be characteristic for the upcoming analyses of LHC data. Following up the work presented at ACAT 2008, we use the multivariate technique presented there (a rule growing algorithm with the meta-m…

2010-11-29abs ↗pdf ↗

Generates synthetic data for benchmarking unsupervised outlier detection.

problem Difficulty in benchmarking unsupervised outlier detection due to rare and varied outliers in real data.
method Proposes a generic process to generate synthetic data with insightful characteristics.
result Demonstrates practicality of the generic process through a benchmark with state-of-the-art detection methods.

We show here that the Nielsen core of the bumping set of the domain of discontinuity of a Kleinian group ΓΓ is the boundary of the characteristic submanifold of the associated 3-manifold with boundary. Some examples of interesting characteristic submanifolds are given. We also give a construction of the characteristic…

2012-08-08abs ↗pdf ↗

A neural network method estimates densities from characteristic functions.

problem Estimating fixed-horizon probability densities from empirical characteristic functions.
method Data-driven Fourier-mixture neural-network method trained in Fourier space.
result Competitive performance and clear gains on heavy-tailed targets.

The study assesses machine learning generalization using various data set characteristics.

problem Estimating confidence in machine learning predictions and assessing generalization capabilities.
method Meta-analysis of 109 classification data sets, modeling generalization as a function of various characteristics.
result The convex hull of the training data is relevant for assessing machine learning generalization, challenging the common assumption about the curse of dimensionality.

The paper analyzes heat trace asymptotics for de Rham and Dolbeault complexes in both real and complex settings.

problem Examining heat trace asymptotics for de Rham and Dolbeault complexes in different geometric settings.
method Analyzing the derived heat trace asymptotics for generalized Witten perturbations in both real and complex settings.
result The integral of the local density for the derived heat trace asymptotics is related to the Euler characteristic and characteristic numbers of the tangent and twisting vector bundles.

Path signatures adapted for Lie groups improve action recognition in computer vision.

problem Improving action recognition in computer vision with geometric constraints.
method Lifting path signatures to Lie groups and proving universality and characteristic property.
result Path signatures on Lie groups provide comparable performance to shallow learning approaches in action recognition.

Representation learning (RL) plays an important role in extracting proper representations from complex medical data for various analyzing tasks, such as patient grouping, clinical endpoint prediction and medication recommendation. Medical data can be divided into two typical categories, outpatient and inpatient, that h…

2019-04-18abs ↗pdf ↗

Solves Einstein vacuum equations gluing problem for close Minkowski data.

problem Solving the characteristic gluing problem for Einstein vacuum equations.
method Derived infinite-dimensional and 10-dimensional gauge-dependent and gauge-invariant charges; constructed null lapse function and conformal geometry.
result Obstructions to gluing problem are gauge-dependent charges, modulo gauge-invariant charges.

The paper explores conditions for homothetic Killing vectors on spacetime hypersurfaces.

problem Conditions for the existence of homothetic Killing vectors on spacetime hypersurfaces.
method General identities relating deformation tensor and tensor on hypersurfaces, applied to specific settings.
result Necessary and sufficient conditions for homothetic Killing vectors on spacetime hypersurfaces.

Paper glues characteristic data to Kerr spacetime, proving spacelike gluing.

problem Solving characteristic gluing problem for Einstein vacuum equations.
method Detailed characteristic gluing of strongly asymptotically flat data to Kerr spacetime.
result Alternative proof of spacelike gluing construction for strongly asymptotically flat spacelike initial data.

The paper proposes a method to assess surrogate heterogeneity in non-randomized data.

problem Lack of methods to evaluate surrogate heterogeneity in non-randomized data.
method Proposes a framework using meta-learners to assess surrogate heterogeneity in real-world data.
result Identifies individuals for whom the surrogate is a valid replacement of the primary outcome.

The paper extends Chern-Weil-Lecomte map to LL_{\infty}-algebras.

problem Defining characteristic classes for LL_{\infty}-algebra extensions.
method Using the Chern-Weil-Lecomte map to define characteristic classes in an LL_{\infty}-algebra setting.
result Unified definition of several known cohomology classes.

A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite union of orbits of the automorphism group, and show that the translation length o…

2007-04-29abs ↗pdf ↗

This paper presents a novel data-driven technique based on the spatiotemporal pattern network (STPN) for energy/power prediction for complex dynamical systems. Built on symbolic dynamic filtering, the STPN framework is used to capture not only the individual system characteristics but also the pair-wise causal dependen…

2017-02-03abs ↗pdf ↗

We study a Laplacian operator related to the characteristic cohomology of a smooth manifold endowed with a distribution. We prove that this Laplacian does not behave very well: it is not hypoelliptic in general and does not respect the bigrading on forms in a complex setting. We also discuss the consequences of these n…

2013-04-17abs ↗pdf ↗

Study Euler characteristic of manifolds with almost nonnegative curvature operator, showing nonnegativity under certain conditions.

problem Addressing the sign of Euler characteristic for manifolds with almost nonnegative curvature operator.
method Analyzing closed manifolds with uniform upper bounds on curvature operator and applying ANCO-type conditions.
result Nonnegative Euler characteristic for closed 2n2n-dimensional manifolds with almost nonnegative curvature operator and uniform upper bounds on curvature.

New framework for interpretable firm characteristics factors.

problem Creating statistically efficient and economically interpretable factors from firm characteristics.
method Grouping related characteristics and deriving one factor per group, combining economic intuition with data-driven clustering.
result Parsimonious, transparent factors outperform benchmarks in out-of-sample tests.

New framework for dense weighted networks with community-specific patterns.

problem Dense networks with varying edge weights across communities.
method Proposes a new model with functions mapping node characteristics to edge weights, requiring few parameters.
result Developed a bootstrap methodology for generating new networks.

In this paper we present a technique for using the bootstrap to estimate the operating characteristics and their variability for certain types of ensemble methods. Bootstrapping a model can require a huge amount of work if the training data set is large. Fortunately in many cases the technique lets us determine the eff…

2017-10-24abs ↗pdf ↗

Dynamic treatment effects estimated over time using covariate balancing.

problem Estimating treatment effects in panel data with dynamic treatments.
method Dynamic covariate balancing with potential local projections.
result Established inferential guarantees for the proposed method.

Paper solves Einstein vacuum equations gluing problem with applications.

problem Solving characteristic gluing problem for Einstein vacuum equations.
method Codimension-10 gluing construction, relating charges to ADM energy, and localized version.
result Asymptotically flat data can be glued to Kerr spacetime with 10 charges.

Higher bootstrap rates than 1.0 improve random forest performance.

problem Improving random forest performance with bootstrap sampling rates greater than 1.0.
method Evaluated 36 diverse datasets with bootstrap rates ranging from 1.2 to 5.0.
result Higher bootstrap rates (BR > 1.0) statistically improve classification accuracy in random forests.

Paper defines and proves geometric uniqueness of Einstein field equations.

problem Einstein field equations characteristic Cauchy problem
method Covariant definition of double null data, proving geometric uniqueness
result Double null data fully covariant and geometrically unique

Given a finite simplicial complex L and a collection of pairs of spaces indexed by its vertex set, one can define their polyhedral product. We record a simple formula for its Euler characteristic. In special cases the formula simplifies further to one involving the h-polynomial of L.

2011-03-15abs ↗pdf ↗

Decision forests are widely used for classification and regression tasks. A lesser known property of tree-based methods is that one can construct a proximity matrix from the tree(s), and these proximity matrices are induced kernels. While there has been extensive research on the applications and properties of kernels, …

2018-11-30abs ↗pdf ↗

Current deep learning models are mostly build upon neural networks, i.e., multiple layers of parameterized differentiable nonlinear modules that can be trained by backpropagation. In this paper, we explore the possibility of building deep models based on non-differentiable modules. We conjecture that the mystery behind…

2017-02-28abs ↗pdf ↗

Testing the implementation of deep learning systems and their training routines is crucial to maintain a reliable code base. Modern software development employs processes, such as Continuous Integration, in which changes to the software are frequently integrated and tested. However, testing the training routines requir…

2019-01-14abs ↗pdf ↗