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.

169,051 papers · 148 categories

Trend · papers per month

127254380507 · Jun 202019922001200920172026
48 results for Real-Valued Prediction

RNNs learn combinatorial graph problems with sample complexity bounds.

problem Learning efficient approximations for real-valued combinatorial graph problems.
method Upper bounds the sample complexity for learning real-valued RNNs.
result Real-valued RNNs can be learned with polynomial number of samples.

The paper develops a method to achieve fairness in predictions using Wasserstein barycenters.

problem Learning a fair real-valued function independent of sensitive attributes.
method Establishing a connection between fair regression and optimal transport theory, deriving a close form expression for the optimal fair predictor as the Wasserstein barycenter of sensitive groups.
result The optimal fair predictor's distribution is the Wasserstein barycenter of sensitive groups' distributions, offering an intuitive interpretation and a simple post-processing algorithm.

System predicts vehicle interactions and trajectories with uncertainty.

problem Predicting future vehicle trajectories with uncertainty.
method Hierarchical Bayesian Generative Modeling with categorized and real-valued coordination variables.
result Categorized coordination better captures multi-modality and generates more diverse samples.

Variational autoencoders (VAEs), as well as other generative models, have been shown to be efficient and accurate for capturing the latent structure of vast amounts of complex high-dimensional data. However, existing VAEs can still not directly handle data that are heterogenous (mixed continuous and discrete) or incomp…

2018-07-10abs ↗pdf ↗

The paper introduces fair regression methods to predict real-valued outcomes while ensuring fairness.

problem Predicting real-valued outcomes while ensuring fairness with respect to protected attributes.
method Proposes schemes for fair regression under statistical parity and bounded group loss, applicable to various losses.
result The schemes provide theoretical guarantees on the optimality and fairness of the obtained solutions.

Extends Tanimoto kernel to real-valued functions.

problem Measuring similarity between real-valued functions.
method Unified representation of real-valued functions via sets, derived general form of the kernel, explicit feature representation, and smooth approximation.
result General Tanimoto kernel for real-valued functions.

This study examines how discretization improves neural forecasting models.

problem Improving predictive performance of neural forecasting models.
method Empirical investigation of data binning techniques on various neural forecasting architectures.
result Data binning almost always improves forecasting accuracy, but the type of binning is less important.

We study the problem of distribution to real-value regression, where one aims to regress a mapping ff that takes in a distribution input covariate PIP\in \mathcal{I} (for a non-parametric family of distributions I\mathcal{I}) and outputs a real-valued response Y=f(P)+εY=f(P) + ε. This setting was recently studied, and a "K…

2013-11-10abs ↗pdf ↗

Study introduces indecomposability for varifolds, leading to geometric consequences.

problem Understanding the structure of varifolds and their connectedness properties.
method Introducing indecomposability and related concepts for varifolds.
result Substantial geometric consequences derived from the connectedness properties of varifolds.

ERAPS builds prediction sets for time-series data.

problem Uncertainty quantification in complex machine learning methods for time-series data.
method ERAPS is an ensemble-based framework for constructing prediction sets for time-series data, allowing unknown dependencies within features and responses.
result ERAPS demonstrates valid marginal and conditional coverage and yields smaller prediction sets than competing methods.

Learning rule consistency tied to non-existence of real-valued measurable cardinals.

problem Consistency of k-NN learning rule in metric spaces.
method Analyzing separable subspaces and density conditions.
result The k-NN classifier's consistency depends on the absence of real-valued measurable cardinals.

The classical Kaehler potential is a real-valued function (KP) such that one can determine a Kaehler (symplectic) structure by differentiating KP. We define a mirror Kaehler potential on Calabi-Yau 3-folds, a real-valued function (MKP) such that one can determine a complex structure by differentiating MKP.

2011-10-21abs ↗pdf ↗

We give an algorithmically efficient version of the learner-to-compression scheme conversion in Moran and Yehudayoff (2016). In extending this technique to real-valued hypotheses, we also obtain an efficient regression-to-bounded sample compression converter. To our knowledge, this is the first general compressed regre…

2018-05-21abs ↗pdf ↗

B-CP reduces knowledge graph model size by replacing real-valued embeddings with binary values.

problem Storage inefficiency in vector embeddings for large knowledge graphs.
method Binarized CANDECOMP/PARAFAC (B-CP) decomposition algorithm.
result B-CP reduces model size by more than an order of magnitude while maintaining task performance.

The study analyzes decision trees on real and categorical features, deriving bounds on their VC dimension and proposing improved pruning algorithms.

problem Understanding the generalization properties of decision trees on different types of features.
method Introducing partitioning functions, relating them to growth functions and VC dimension, and deriving bounds for decision stumps and trees of various structures.
result Exact VC dimension of decision stumps and improved pruning algorithms for binary trees.

Learning a regression function using censored or interval-valued output data is an important problem in fields such as genomics and medicine. The goal is to learn a real-valued prediction function, and the training output labels indicate an interval of possible values. Whereas most existing algorithms for this task are…

2017-10-11abs ↗pdf ↗

Study robust regression learning under adversarial attacks.

problem Understanding which function classes are learnable in the presence of adversarial attacks.
method Introduced a novel agnostic sample compression scheme and used fat-shattering dimension to construct adversarially robust sample compression schemes.
result Finite fat-shattering dimension classes are learnable in both realizable and agnostic settings.

These lecture notes provide a self-contained introduction to the mathematical methods required in a Bachelor degree programme in Business, Economics, or Management. In particular, the topics covered comprise real-valued vector and matrix algebra, systems of linear algebraic equations, Leontief's stationary input-output…

2015-09-11abs ↗pdf ↗

FuBIF enhances AD by using real-valued functions for more flexible anomaly detection.

problem Limitations of the Isolation Forest in adaptability and bias.
method Introduces FuBIF, a generalization of IF using real-valued functions for branching in evaluation trees.
result FuBIF significantly improves flexibility and evaluation tree construction.

In a complete Riemannian manifold (M,g)(M, g) if the hessian of a real valued function satisfies some suitable conditions then it restricts the geometry of (M,g)(M, g). In this paper we characterize all compact rank-1 symmetric spaces, as those Riemannian manifolds (M,g)(M, g) admitting a real valued function uu such that the …

1995-11-23abs ↗pdf ↗

This paper proposes a probabilistic imputation method with uncertainty quantification.

problem Missing value imputation with uncertainty estimation for large datasets.
method Low Rank Gaussian Copula framework that augments PPCA with column-specific transformations.
result The method yields state-of-the-art imputation accuracy and well-calibrated uncertainty estimates.

Unique solutions found for diffusive martingale problems.

problem Finding unique solutions to Cauchy problems for diffusive real-valued strict local martingales.
method Provided sets of smooth functions under local Hölder and Engelbert-Schmidt conditions for unique classical and weak solutions.
result Unique solutions found for specific martingale models.

Despite the superior performance of deep learning in many applications, challenges remain in the area of regression on function spaces. In particular, neural networks are unable to encode function inputs compactly as each node encodes just a real value. We propose a novel idea to address this shortcoming: to encode an …

2018-04-13abs ↗pdf ↗

Evolutionary algorithms improve decision tree ensembles.

problem Improving predictive performance of decision trees.
method Real-valued vector representation of decision trees, evolutionary algorithms (Differential evolution, Evolution strategies).
result Proposed methods outperform classical decision tree induction algorithms.

A new convex loss function optimizes set predictions with balanced size and coverage.

problem Optimizing set predictions with balanced size and coverage.
method Proposes a convex loss function using Choquet integrals for nondecreasing subset-valued functions.
result Optimal trade-offs between conditional probabilistic coverage and set size.

We introduce RNADE, a new model for joint density estimation of real-valued vectors. Our model calculates the density of a datapoint as the product of one-dimensional conditionals modeled using mixture density networks with shared parameters. RNADE learns a distributed representation of the data, while having a tractab…

2013-06-02abs ↗pdf ↗

In this note we prove the a pointwise ergodic theorem for functions taking values in a separable complete CAT(0)-space, analogous to Lindenstrauss' pointwise ergodic theorem for real-valued integrable functions on a probability space subject to a probability-preserving action of an amenable l.c.s.c. group, where in the…

2009-05-05abs ↗pdf ↗

The construction of synthetic complex-valued signals from real-valued observations is an important step in many time series analysis techniques. The most widely used approach is based on the Hilbert transform, which maps the real-valued signal into its quadrature component. In this paper, we define a probabilistic gene…

2016-11-30abs ↗pdf ↗

The class of affine LIBOR models is appealing since it satisfies three central requirements of interest rate modeling. It is arbitrage-free, interest rates are nonnegative and caplet and swaption prices can be calculated analytically. In order to guarantee nonnegative interest rates affine LIBOR models are driven by no…

2015-03-03abs ↗pdf ↗