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

158316473631 · Jun 202019922001200920172026
48 results for output spaces

The paper presents a novel approach to multi-output regression using probabilistic circuits.

problem Capturing correlations between multiple output dimensions in large-scale regression problems.
method Employing a mixture of single-output Gaussian process experts encoded via a probabilistic circuit.
result The method can capture correlations between output dimensions and often outperforms other approaches.

Gradient flow in parameters equals linear interpolation in outputs.

problem Understanding and optimizing training algorithms in deep learning.
method Proving equivalence between gradient flow in parameter space and linear interpolation in output space, and deriving formulas for global minima.
result Gradient flow in parameters can be transformed into linear interpolation in outputs, leading to global minima.

Bayesian neural network (BNN) priors are defined in parameter space, making it hard to encode prior knowledge expressed in function space. We formulate a prior that incorporates functional constraints about what the output can or cannot be in regions of the input space. Output-Constrained BNNs (OC-BNN) represent an int…

2019-05-15abs ↗pdf ↗

State-space systems generate probabilistic dependencies between inputs and outputs.

problem Understanding probabilistic dependencies in state-space systems.
method Introducing a probabilistic framework and proving sufficient conditions for output existence and uniqueness.
result State-space systems can generate probabilistic dependencies, even without functional relations.

We study the problem of structured output learning from a regression perspective. We first provide a general formulation of the kernel dependency estimation (KDE) problem using operator-valued kernels. We show that some of the existing formulations of this problem are special cases of our framework. We then propose a c…

2012-05-10abs ↗pdf ↗

We consider a framework for structured prediction based on search in the space of complete structured outputs. Given a structured input, an output is produced by running a time-bounded search procedure guided by a learned cost function, and then returning the least cost output uncovered during the search. This framewor…

2012-06-27abs ↗pdf ↗

A new conformal prediction framework for graph-valued outputs using Z-Gromov-Wasserstein distances.

problem Lack of principled uncertainty quantification for graph-valued supervised prediction.
method Proposes a conformal prediction framework using Z-Gromov-Wasserstein distances for graph-valued outputs.
result Provides distribution-free coverage guarantees for graph-valued outputs.

A new method reduces both input and output dimensions for better goal-oriented analysis.

problem Simultaneous reduction of input and output dimensions for more accurate analysis.
method Coupled input-output dimension reduction, optimizing gradient-based bounds.
result Determine most informative sensors and influential parameters efficiently.

Study efficient neural operator learning using variation spaces.

problem Operator learning using encoder-decoder neural networks.
method Introduce variation space for nonlinear operators, establish approximation bounds.
result Algebraic approximation and learning rates for polynomially decaying input and output encoding errors.

Sig-PCA integrates model outputs and observations to correct model biases.

problem Improving model accuracy and reliability by correcting biases and numerical approximations.
method Sig-PCA framework that combines summary statistics from model outputs with localized observations via a neural network.
result Corrects model outputs to align closely with observational data, preserving essential statistical information.

Deep neural networks for structured prediction using kernel-induced losses.

problem Structured prediction tasks for images and texts.
method Designing a novel family of deep neural architectures that predict in a finite-dimensional subspace derived from the kernel-induced loss.
result Gradient descent algorithms can be used for structured prediction with deep neural networks.

Combines neural networks with variational inference for better uncertainty quantification.

problem Overconfident predictions from traditional neural networks and time-consuming Bayesian optimization.
method VIFO (Variational Inference on the Final-Layer Output) using neural networks to learn mean and variance.
result VIFO provides a good tradeoff in run time and uncertainty quantification, especially for out of distribution data.

Study efficient interactive learning for structured outputs with reliable computation.

problem Interactive learning with noisy labels and structured output spaces.
method Identify and utilize CRISPs (probabilistic models) that guarantee reliable and efficient computation of probabilistic quantities.
result CRISPs enable robust and efficient active and skeptical learning in large structured output spaces.

When learning a mapping from an input space to an output space, the assumption that the sample distribution of the training data is the same as that of the test data is often violated. Unsupervised domain shift methods adapt the learned function in order to correct for this shift. Previous work has focused on utilizing…

2017-03-05abs ↗pdf ↗

We consider the problem of retrieving the most relevant labels for a given input when the size of the output space is very large. Retrieval methods are modeled as set-valued classifiers which output a small set of classes for each input, and a mistake is made if the label is not in the output set. Despite its practical…

2018-10-16abs ↗pdf ↗

This paper introduces hyperspherical prototype networks, which unify classification and regression with prototypes on hyperspherical output spaces. For classification, a common approach is to define prototypes as the mean output vector over training examples per class. Here, we propose to use hyperspheres as output spa…

2019-01-29abs ↗pdf ↗

Predicting structured outputs can be computationally onerous due to the combinatorially large output spaces. In this paper, we focus on reducing the prediction time of a trained black-box structured classifier without losing accuracy. To do so, we train a speedup classifier that learns to mimic a black-box classifier u…

2018-06-11abs ↗pdf ↗

Within machine learning, the supervised learning field aims at modeling the input-output relationship of a system, from past observations of its behavior. Decision trees characterize the input-output relationship through a series of nested ifthenelseif-then-else questions, the testing nodes, leading to a set of predictions, th…

2017-04-26abs ↗pdf ↗

Contrast uses normalizing flows to create precise prediction regions for multi-dimensional outputs.

problem Generating reliable prediction regions for multi-dimensional outputs in supervised and unsupervised learning.
method Contrast uses normalizing flows to define nonconformity scores based on distances in latent space, creating sharp prediction regions.
result Contrast maintains guaranteed coverage probability and outperforms existing methods in generating accurate prediction regions.

Unified approach to structured prediction combining entropy regularization and neuro-symbolic logic.

problem Structured prediction challenges due to large output spaces and insufficient labeled data.
method Neuro-symbolic entropy regularization loss that restricts entropy regularization to valid structures.
result Models predict more accurately and are more likely to be valid.

We study algebraic varieties of ReLU networks to understand their representable functions.

problem Understanding the functions that ReLU neural networks can represent.
method We introduce algebraic varieties associated with ReLU networks and derive polynomial equations to characterize representable functions.
result Conditions under which ReLU networks attain their expected dimension, providing insight into their structural properties.

JES optimizes expensive functions by considering joint entropy over input and output spaces.

problem Optimizing expensive functions with limited evaluations.
method Joint Entropy Search (JES) considers joint entropy over input and output spaces.
result JES outperforms other information-theoretic methods in Bayesian optimization.

Efficiently approximates uncertainty in classification models using Dirichlet distributions.

problem Inefficient computation of uncertainty estimates in Bayesian deep learning.
method Revised Laplace Bridge method to construct a Dirichlet approximation of softmax output distributions.
result The Dirichlet approximation leads to more efficient computation and better uncertainty estimates.

Paper introduces vector-valued variation spaces for multi-output neural networks.

problem Understanding and optimizing multi-output neural networks.
method Development of vector-valued variation spaces and representer theorem.
result Novel bounds for layer widths in deep networks and a convex optimization method for compression.

Paper develops efficient recursive learning for multi-channel systems with heterogeneous dynamics.

problem Accurately learning system dynamics in complex, multi-channel systems with nonlinear and noisy data.
method Formulates system as Gaussian process state-space models (GPSSMs), introduces heterogeneous multi-output kernel, and develops recursive inference framework.
result Matches SOTA offline GPSSMs in accuracy with 1/100 runtime, and outperforms SOTA online GPSSMs by 70% in accuracy under noise with 1/20 runtime.

A new method reduces high-dimensional parameter spaces for faster numerical tasks.

problem Efficiently reducing high-dimensional parameter spaces for numerical tasks.
method Local Active Subspaces (LAS) combining active subspaces with clustering techniques.
result Significant speed-up in numerical tasks through efficient dimension reduction.

A method constructs a stochastic surrogate from dimensionality reduction results for high-dimensional uncertainty quantification.

problem High-dimensional uncertainty quantification with physics-based models.
method Constructs a stochastic surrogate model from dimensionality reduction results.
result Preserves convenience of sequential dimensionality reduction and Gaussian process regression while overcoming limitations.

Consider a general machine learning setting where the output is a set of labels or sequences. This output set is unordered and its size varies with the input. Whereas multi-label classification methods seem a natural first resort, they are not readily applicable to set-valued outputs because of the growth rate of the o…

2019-03-12abs ↗pdf ↗

We propose a general approach for supervised learning with structured output spaces, such as combinatorial and polyhedral sets, that is based on minimizing estimated conditional risk functions. Given a loss function defined over pairs of output labels, we first estimate the conditional risk function by solving a (possi…

2016-11-21abs ↗pdf ↗

Complex textual information extraction tasks are often posed as sequence labeling or \emph{shallow parsing}, where fields are extracted using local labels made consistent through probabilistic inference in a graphical model with constrained transitions. Recently, it has become common to locally parametrize these models…

2018-09-28abs ↗pdf ↗