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,181 papers · 148 categories

Trend · papers per month

4408801,3201,760 · Jun 202019922001200920182026
48 results for Structured Output Learning

Paper proposes active learning for structured output design, improving Gaussian process model predictions.

problem Finding optimal input parameters for achieving desired structured outputs.
method Developed new acquisition functions to minimize prediction error of Gaussian process model, incorporating output correlations.
result Effectiveness demonstrated in synthetic and real data experiments, including materials informatics.

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.

SOLA framework predicts structured outputs with abstention for opinion analysis.

problem Accurate opinion prediction in structured outputs.
method Decomposes problem into structured abstention and prediction, uses asymmetric losses, surrogate regression, and pre-image problem.
result Extends statistical guarantees on excess risk for fine-grained opinion mining.

A deep neural network model is a powerful framework for learning representations. Usually, it is used to learn the relation xyx \to y by exploiting the regularities in the input xx. In structured output prediction problems, yy is multi-dimensional and structural relations often exist between the dimensions. The motiv…

2015-04-28abs ↗pdf ↗

Paper improves generalization bounds for structured output prediction problems.

problem Large label sets in structured output prediction problems.
method Developed novel high-probability bounds and generalization bounds in expectation.
result Significantly improved generalization bounds with logarithmic dependency on label set size.

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 ↗

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 ↗

DeepICMGP surrogate models multiple outputs efficiently.

problem Challenges in modeling dependencies between multiple outputs using traditional multi-output GPs.
method Introduces hierarchical coregionalization structures across layers in DGPs.
result Demonstrates competitive performance and active learning strategies.

Paper introduces c-Glow for efficient structured output learning.

problem Intractable computation of conditional likelihood in structured prediction models.
method Conditional Glow (c-Glow) - a conditional generative flow that computes p(y|x) exactly and efficiently.
result c-Glow outperforms state-of-the-art baselines in structured prediction tasks.

Trained SPENs with efficient search in reward function for structured prediction.

problem Expensive ground-truth labeling in structured output prediction.
method Efficient truncated randomized search in reward function for training SPENs.
result Local improvements and effective supervision for SPENs without labeled data.

Approach uses machine learning to identify structural modal parameters from output-only data.

problem Identifying modal parameters from output-only data for structural health monitoring.
method Unsupervised learning using a self-coding deep neural network to separate modal responses from vibration data.
result The approach effectively identifies structural modal parameters from system responses.

Graph-to-Tree Neural Networks improve structured input-output translation in tasks like semantic parsing and math word problems.

problem Improving performance on tasks like semantic parsing and math word problem solving.
method Graph-to-Tree Neural Networks, consisting of a graph encoder and a hierarchical tree decoder.
result Graph2Tree model outperforms or matches state-of-the-art models on neural semantic parsing and math word problem tasks.

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.

The study addresses negative transfer in multi-output Gaussian processes by proposing latent structures.

problem Negative transfer in multi-output Gaussian processes leading to decreased performance.
method Defining negative transfer, deriving conditions for avoiding it, proposing latent structures.
result Latent structures can avoid negative transfer and scale to large datasets.

Adversarial constraint learning improves structured prediction with minimal labeled data.

problem Reducing the need for manual label collection in structured prediction tasks.
method Simulates valid structured outputs and trains a model to produce outputs indistinguishable from these simulations using adversarial training.
result The model achieves high accuracy with only a small number of labeled inputs, sometimes requiring none.

Reduced-rank method improves least-squares regression under output regularity.

problem Least-squares regression with infinite dimensional outputs.
method Reduced-rank method for solving least-squares problems with output regularity assumptions.
result Learning bounds and improved statistical performance compared to full-rank method.

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.

Inference network approximates structured argmax inference for structured prediction.

problem Efficient inference for complex structured prediction problems.
method Trains a neural network to approximate structured argmax inference, using large-margin training criteria.
result Significant speed-ups and improved accuracy compared to gradient descent methods.

A neural network finds causal relationships among latent variables.

problem Learning causal structure among latent variables in high-dimensional data.
method Redundant Input Neural Network (RINN) with modified architecture and regularized objective function.
result The RINN method successfully recovers latent causal structure between input and output variables.

Improved code translation by preserving structure with composed fine-tuning.

problem Improving code translation accuracy with unlabeled code outputs.
method Pre-trained denoiser to capture output structure, composed fine-tuning to fine-tune predictor.
result Composed fine-tuning significantly improves generalization over standard fine-tuning.

The paper defines conditions for learning causal graphs from data with unobserved variables.

problem Learning causal graphs from data with unobserved variables.
method Formalizes constraint-based structure learning algorithms under conditions and assumptions.
result Natural family of algorithms output Markov equivalent graphs to the causal graph under faithfulness assumption.

In this paper we study output coding for multi-label prediction. For a multi-label output coding to be discriminative, it is important that codewords for different label vectors are significantly different from each other. In the meantime, unlike in traditional coding theory, codewords in output coding are to be predic…

2012-06-27abs ↗pdf ↗

Learning structured outputs with general structures is computationally challenging, except for tree-structured models. Thus we propose an efficient boosting-based algorithm AdaBoost.MRF for this task. The idea is based on the realization that a graph is a superimposition of trees. Different from most existing work, our…

2014-07-24abs ↗pdf ↗

JacNet learns Jacobians to enforce structure on derivatives for invertibility and Lipschitz functions.

problem Enforcing structure on derivatives of neural network mappings.
method Proposes using a neural network to directly learn the Jacobian of the input-output function, allowing control over derivative structure.
result Demonstrates learning invertible approximations to simple and 1-Lipschitz functions.

Stochastic structured prediction under bandit feedback follows a learning protocol where on each of a sequence of iterations, the learner receives an input, predicts an output structure, and receives partial feedback in form of a task loss evaluation of the predicted structure. We present applications of this learning …

2016-06-02abs ↗pdf ↗

Gradient boosting adapted for multi-label and multi-output tasks.

problem Joint prediction of multiple classification or regression outputs.
method Gradient tree boosting with random output projections.
result Random projection improves adaptation to different output correlation patterns.

Neural framework learns one solution from multiple for combinatorial problems.

problem Finding any one of many possible solutions for combinatorial problems.
method Adapts existing prediction networks to handle solution multiplicity using a selection module trained via RL.
result Framework significantly improves accuracy in solving combinatorial problems.

Structured learning is appropriate when predicting structured outputs such as trees, graphs, or sequences. Most prior work requires the training set to consist of complete trees, graphs or sequences. Specifying such detailed ground truth can be tedious or infeasible for large outputs. Our main contribution is a large m…

2012-06-27abs ↗pdf ↗

Deep structured output learning shows great promise in tasks like semantic image segmentation. We proffer a new, efficient deep structured model learning scheme, in which we show how deep Convolutional Neural Networks (CNNs) can be used to estimate the messages in message passing inference for structured prediction wit…

2015-06-06abs ↗pdf ↗

Develops a new model for deep structured prediction with non-linear output transformations.

problem Limited neighborhood structure and inability to transform output space in deep structured models.
method Introduces a novel model that generalizes existing approaches and maintains applicability of inference techniques.
result Demonstrates improved flexibility and applicability of deep structured models through non-linear output transformations.

Paper presents a framework to automatically discover constraints from data.

problem Discovering constraints from data for structured output prediction.
method Formulates structured output prediction as ILP, mines constraints by estimating polytopes of feasible set.
result Successfully identifies feasible sets and constraints for various tasks.

The paper proposes a method to learn from neighbor annotations to improve predictions in ambiguous tasks.

problem Ambiguity in structured prediction problems with large output spaces makes exhaustive annotation impractical.
method Proposes an objective to transfer supervision from neighboring examples to improve predictions.
result Consistent improvements over standard maximum likelihood training and baselines in multi-label classification and image-grounded sequence modeling tasks.