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

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for partial supervision

Paper proposes an algorithm to recover full supervision from weakly labeled data.

problem Machine learning requires expensive data annotation, motivating the use of weak supervision.
method The paper introduces a disambiguation principle and an empirical disambiguation algorithm for partial labelling.
result The algorithm achieves exponential convergence rates under learnability assumptions.

We present a simple, flexible, and general framework titled Partial Registration Network (PRNet), for partial-to-partial point cloud registration. Inspired by recently-proposed learning-based methods for registration, we use deep networks to tackle non-convexity of the alignment and partial correspondence problems. Whi…

2019-10-27abs ↗pdf ↗

Annotating datasets is one of the main costs in nowadays supervised learning. The goal of weak supervision is to enable models to learn using only forms of labelling which are cheaper to collect, as partial labelling. This is a type of incomplete annotation where, for each datapoint, supervision is cast as a set of lab…

2020-03-02abs ↗pdf ↗

New method estimates model performance bounds without ground truth labels.

problem Evaluation of weakly supervised models without direct access to ground truth labels.
method Formulates model evaluation as a partial identification problem and uses Fréchet bounds for performance estimation.
result Derives accurate and computationally efficient bounds for key metrics like accuracy, precision, recall, and F1-score.

Semi-supervised wrapper methods are concerned with building effective supervised classifiers from partially labeled data. Though previous works have succeeded in some fields, it is still difficult to apply semi-supervised wrapper methods to practice because the assumptions those methods rely on tend to be unrealistic i…

2016-11-12abs ↗pdf ↗

RL struggles with generalization due to implicit partial observability.

problem Generalization in RL is difficult due to implicit partial observability.
method Re-cast RL problem as solving epistemic POMDPs and propose ensemble-based techniques.
result Simple ensemble-based technique achieves significant generalization gains.

DiffATD efficiently discovers targets in partially observable environments using diffusion dynamics.

problem Efficiently discovering targets in partially observable environments with limited sampling.
method DiffATD uses diffusion dynamics to maintain a belief distribution over unobserved states, balancing exploration and exploitation.
result DiffATD outperforms baselines and supervised methods in diverse domains.

This paper reviews and compares supervised linear dimension-reduction techniques.

problem Lack of information in the response during unsupervised PCA reduces predictive performance.
method Review and comparison of supervised linear dimension-reduction techniques.
result PLS and LSPCA consistently outperform other techniques in simulations.

We study learning latent models with multi-instance weak supervision.

problem Learning latent models with multi-instance weak supervision.
method Formulated as multi-instance Partial Label Learning (multi-instance PLL), proposed a necessary and sufficient condition for learnability, derived Rademacher-style error bounds.
result First theoretical study of multi-instance PLL with unknown transition function, aligns with empirical results but highlights scalability issues.

New method uses weak labels to create valid confidence sets for predictions.

problem Lack of labeled data in machine learning models.
method Developed a conformal prediction framework to provide valid predictive confidence sets using weakly labeled data.
result New coverage definition allows for tighter and more informative (but valid) confidence sets.

Paper tackles singularity detection in PDEs using data-driven self-supervised learning.

problem Detecting singularities in PDE solutions for efficient numerical methods.
method Data-driven self-supervised learning framework with filtering tasks.
result Proposes filtering methods for raw unlabeled data to improve singularity detection.

Proposes a multimodal deep generative model for semi-supervised learning with class imbalance.

problem Class imbalance in semi-supervised learning with partial supervision.
method Separate encoders for each modality, sharing latent variables, and using Student's t-distributions for prior, encoder, and decoder.
result Outperforms baseline methods in generalization and classification performance for partially labeled multimodal data.

Community detection was a hot topic on network analysis, where the main aim is to perform unsupervised learning or clustering in networks. Recently, semi-supervised learning has received increasing attention among researchers. In this paper, we propose a new algorithm, called weighted inverse Laplacian (WIL), for predi…

2019-01-07abs ↗pdf ↗

Deep neural networks trained to inpaint partially occluded images show a deep understanding of image composition and have even been shown to remove objects from images convincingly. In this work, we investigate how this implicit knowledge of image composition can be leveraged for fully self-supervised instance separati…

2020-02-28abs ↗pdf ↗

Paper introduces robust learning methods using coordinate gradient descent.

problem Supervised learning with corrupted features and labels.
method Coordinate gradient descent combined with robust estimators of partial derivatives.
result Robust learning methods with nearly identical numerical complexity to non-robust ones.

We investigate probabilistic decoupling of labels supplied for training, from the underlying classes for prediction. Decoupling enables an inference scheme general enough to implement many classification problems, including supervised, semi-supervised, positive-unlabelled, noisy-label and suggests a general solution to…

2019-05-29abs ↗pdf ↗

The goal of semi-supervised learning is to improve supervised classifiers by using additional unlabeled training examples. In this work we study a simple self-learning approach to semi-supervised learning applied to the least squares classifier. We show that a soft-label and a hard-label variant of self-learning can be…

2016-10-12abs ↗pdf ↗

We introduce the Neural Conditioner (NC), a self-supervised machine able to learn about all the conditional distributions of a random vector XX. The NC is a function NC(xa,a,r)NC(x \cdot a, a, r) that leverages adversarial training to match each conditional distribution P(XrXa=xa)P(X_r|X_a=x_a). After training, the NC generalizes to …

2019-02-22abs ↗pdf ↗

We consider the predictive problem of supervised ranking, where the task is to rank sets of candidate items returned in response to queries. Although there exist statistical procedures that come with guarantees of consistency in this setting, these procedures require that individuals provide a complete ranking of all i…

2012-04-07abs ↗pdf ↗

Deep learning for HJB PDEs using synthetic data and residual minimization.

problem Solving Hamilton-Jacobi-Bellman PDEs for optimal control problems.
method Gradient-augmented synthetic dataset for supervised learning, residual minimization.
result Improves accuracy and efficiency of deep learning for HJB PDEs.

Combines Xgboost and transductive SVM for semi-supervised learning.

problem Improving semi-supervised learning performance with heterogeneous tabular data.
method Proposes an optimization-based ensemble method to adaptively combine Xgboost and transductive SVM.
result Significantly improves classification accuracy over state-of-the-art methods.

The paper studies momentum-based minimization for Ginzburg-Landau on Euclidean spaces and graphs.

problem Minimizing the Ginzburg-Landau functional on Euclidean spaces and graphs.
method Momentum-based minimization using a convex-concave splitting-based FISTA-type time discretization.
result Momentum can lead to faster convergence if the time step size is large but not too large.

We propose a novel framework to identify sub-goals useful for exploration in sequential decision making tasks under partial observability. We utilize the variational intrinsic control framework (Gregor et.al., 2016) which maximizes empowerment -- the ability to reliably reach a diverse set of states and show how to ide…

2019-07-24abs ↗pdf ↗

Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the m…

2013-11-26abs ↗pdf ↗