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

6.3%12.5%18.8%25.0% · Oct 199319922001200920182026
48 results for real-valued classification

Complex-valued neural networks perform similarly to real-valued models for real-valued classification tasks.

problem Comparing real-valued and complex-valued neural networks for real-valued classification tasks.
method Comparison of neural networks with similar capacity sizes, using various activation functions and weight initialisation strategies.
result Complex-valued neural networks perform equal to or slightly worse than real-valued models for real-valued classification tasks.

The Lorentzian length, which is one of the most significant functions in Lorentzian geometry, is a complex-valued function. Its square gives a real-valued non-degenerate quadratic function. In this paper, we define naturally extended mappings of Lorentzian distance-squared functions, wherein each component is a Lorentz…

2013-06-19abs ↗pdf ↗

Hadwiger's Theorem states that Euclidean-invariant convex-continuous valuations of definable sets are linear combinations of intrinsic volumes. We lift this result from sets to data distributions over sets, specifically, to definable real-valued functions on n-dimensional Euclidean space. This generalizes intrinsic vol…

2012-03-28abs ↗pdf ↗

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.

We address the problem of general supervised learning when data can only be accessed through an (indefinite) similarity function between data points. Existing work on learning with indefinite kernels has concentrated solely on binary/multi-class classification problems. We propose a model that is generic enough to hand…

2012-10-22abs ↗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.

We present a novel optimization strategy for training neural networks which we call "BitNet". The parameters of neural networks are usually unconstrained and have a dynamic range dispersed over all real values. Our key idea is to limit the expressive power of the network by dynamically controlling the range and set of …

2017-08-16abs ↗pdf ↗

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.

Improved robust learning model with tighter generalization bounds.

problem Adversarial robust learning in environments with limited corruptions.
method Model as a zero-sum game, using regret minimization and ERM oracles.
result Improved sample complexity for robust classifiers, handling infinite hypothesis classes.

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.

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.

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.

The study examines generalization bounds for regression and classification tasks on adaptive input domains.

problem Understanding the generalization error in adaptive input domains for regression and classification.
method The analysis considers regression and classification separately, using Lipschitz continuity and 2-norm/0/1 loss for measurement. It also highlights the polynomial relationship between generalization bounds and network parameters.
result Generalization bounds for regression and classification are inversely proportional to a polynomial of the number of parameters, emphasizing the advantages of over-parameterized networks.

Inverse classification is the process of perturbing an instance in a meaningful way such that it is more likely to conform to a specific class. Historical methods that address such a problem are often framed to leverage only a single classifier, or specific set of classifiers. These works are often accompanied by naive…

2016-10-05abs ↗pdf ↗

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.

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.

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.

This paper provides new insight into maximizing F1 scores in the context of binary classification and also in the context of multilabel classification. The harmonic mean of precision and recall, F1 score is widely used to measure the success of a binary classifier when one class is rare. Micro average, macro average, a…

2014-02-08abs ↗pdf ↗

The abstract defines G2G_2-structures and connects them to octonion algebras.

problem Classifying G2G_2-structures and understanding their geometric properties.
method Established an isomorphism between G2G_2-structures and octonion algebras over C(M)C^\infty(M).
result The classification of G2G_2-structures agrees with a parametrisation of octonion algebras with isometric norm.

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 ↗

Study online learning with set-valued feedback, showing differences between deterministic and randomized approaches.

problem Online learning with set-valued feedback, where labels are sets rather than single labels.
method Introduced new combinatorial dimensions (Set Littlestone and Measure Shattering) to characterize learnability.
result Characterized deterministic and randomized online learnability, and established bounds for various learning settings.

This work proposes a model to disentangle image factors effectively and control their manipulation.

problem Controlling disentanglement during image editing while preserving object identity.
method Encoder-decoder architecture with decorrelation regularization and soft target representations.
result The model successfully disentangles image factors and manipulates them effectively.

Paper improves video feature learning for better downstream tasks.

problem Improving video feature learning for better performance on downstream tasks.
method Self-supervised learning approach using contrastive bidirectional transformer, extending BERT for real-valued feature vectors.
result Significantly improved performance on video classification, captioning, and segmentation tasks.

The Min-Hashing approach to sketching has become an important tool in data analysis, information retrial, and classification. To apply it to real-valued datasets, the ICWS algorithm has become a seminal approach that is widely used, and provides state-of-the-art performance for this problem space. However, ICWS suffers…

2018-03-30abs ↗pdf ↗

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.

We study a certain type of wild harmonic bundles in relation with a Toda equation. We explain how to obtain a classification of the real valued solutions of the Toda equation in terms of their parabolic weights, from the viewpoint of the Kobayashi-Hitchin correspondence. Then, we study the associated integrable variati…

2013-01-08abs ↗pdf ↗

The paper reviews and extends calibration concepts for classification and regression.

problem Formalizing compatibility between probabilistic predictions and outcomes.
method Review and extension of existing calibration concepts, introduction of new concepts.
result Hierarchical relations between calibration concepts for various data types.

A new data-driven sampling method improves GraphSAGE's accuracy in node classification.

problem High variance in neighborhood sampling leads to sub-optimum accuracy in GraphSAGE.
method A data-driven node sampling approach using a non-linear regressor trained with reinforcement learning.
result Enhanced GraphSAGE accuracy in inductive node classification benchmarks.

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 ↗