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

275380106 · May 202619922001200920172026
48 results for set-prediction rules

Improved set prediction model using multiset-equivariant operations and approximate implicit differentiation.

problem Existing set prediction models struggle with multisets and cannot represent certain functions.
method Introduced multiset-equivariance, improved DSPN with approximate implicit differentiation, and applied to CLEVR object property prediction.
result Significantly improved object property prediction on CLEVR dataset.

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.

Paper proposes an alternative to set losses for predicting unordered variables without imposing structure.

problem Learning unordered variables with unknown interrelations without imposing structure.
method Viewing set prediction as conditional density estimation and using deep energy-based models with gradient-guided sampling.
result Empirically demonstrates capability to learn multi-modal densities and produce different plausible predictions.

Current approaches for predicting sets from feature vectors ignore the unordered nature of sets and suffer from discontinuity issues as a result. We propose a general model for predicting sets that properly respects the structure of sets and avoids this problem. With a single feature vector as input, we show that our m…

2019-06-15abs ↗pdf ↗

New approach tackles decision-making under predictions that shape outcomes.

problem Challenges in learning optimal decision rules when predictions influence outcomes.
method Introduces performative omniprediction, a predictor that encodes optimal decision rules for multiple objectives.
result Efficient performative omnipredictors exist under a natural restriction of outcome performativity.

Meta-learning reduces set prediction size in conformal prediction for few-shot calibration.

problem Inefficient set prediction in conformal prediction for limited training data.
method Meta-learning approach using cross-validation-based conformal prediction.
result Meta-learning scheme reduces set prediction size and preserves formal guarantees.

Learning with non-modular losses is an important problem when sets of predictions are made simultaneously. The main tools for constructing convex surrogate loss functions for set prediction are margin rescaling and slack rescaling. In this work, we show that these strategies lead to tight convex surrogates iff the unde…

2015-12-24abs ↗pdf ↗

As entity type systems become richer and more fine-grained, we expect the number of types assigned to a given entity to increase. However, most fine-grained typing work has focused on datasets that exhibit a low degree of type multiplicity. In this paper, we consider the high-multiplicity regime inherent in data source…

2017-04-25abs ↗pdf ↗

Traditional set prediction models can struggle with simple datasets due to an issue we call the responsibility problem. We introduce a pooling method for sets of feature vectors based on sorting features across elements of the set. This can be used to construct a permutation-equivariant auto-encoder that avoids this re…

2019-06-06abs ↗pdf ↗

Structured prediction is used in areas such as computer vision and natural language processing to predict structured outputs such as segmentations or parse trees. In these settings, prediction is performed by MAP inference or, equivalently, by solving an integer linear program. Because of the complex scoring functions …

2015-11-04abs ↗pdf ↗

Ensembles depend on diversity for improved performance. Many ensemble training methods, therefore, attempt to optimize for diversity, which they almost always define in terms of differences in training set predictions. In this paper, however, we demonstrate the diversity of predictions on the training set does not nece…

2019-11-04abs ↗pdf ↗

Kernel Induced Random Survival Forests (KIRSF) is a statistical learning algorithm which aims to improve prediction accuracy for survival data. As in Random Survival Forests (RSF), Cumulative Hazard Function is predicted for each individual in the test set. Prediction error is estimated using Harrell's concordance inde…

2010-08-24abs ↗pdf ↗

Unified framework for generalized Venn and Venn-Abers calibration for reliable prediction.

problem Asymptotic guarantees of popular distribution-free methods in model calibration.
method Unified framework extending Vovk's approach to generic loss functions, transforming predictors into set-valued predictions.
result Finite-sample set predictions shrink to a single conditionally calibrated prediction, capturing epistemic uncertainty.

Proposes real-time risk monitoring for machine learning systems under unknown shifts.

problem Dynamic distribution shifts challenge real-world machine learning systems' risk assurances.
method Sequential hypothesis testing with 'testing by betting' to detect risk violations.
result Effective real-time risk monitoring under various unknown shifts.

Paper improves prediction sets for distribution shifts without labels.

problem Improving prediction sets effectiveness in the presence of distribution shifts.
method Develops ECP and EACP methods to adjust score function based on model uncertainty.
result Consistent improvement over existing baselines and nearly matches fully supervised methods.

Training set bugs are flaws in the data that adversely affect machine learning. The training set is usually too large for man- ual inspection, but one may have the resources to verify a few trusted items. The set of trusted items may not by itself be adequate for learning, so we propose an algorithm that uses these ite…

2018-01-24abs ↗pdf ↗

Techniques known as Nonlinear Set Membership prediction, Kinky Inference or Lipschitz Interpolation are fast and numerically robust approaches to nonparametric machine learning that have been proposed to be utilised in the context of system identification and learning-based control. They utilise presupposed Lipschitz p…

2017-02-28abs ↗pdf ↗

DeepCTRL integrates rules into deep learning models, allowing flexible control at inference.

problem Lack of flexibility in incorporating rules into deep learning models.
method Integrates rule representations into deep neural networks, enabling flexible control at inference.
result Improves rule verification ratio and accuracy gains at downstream tasks.

New methods prune unpromising rules from KGs, improving scalability and runtime.

problem Scalability issues in walk-based rule learning from KGs.
method Rule Hierarchy Framework (RHF) and Hierarchical Pruning (HPMs).
result Significant reductions in runtime and number of learned rules without compromising predictive performance.

L-ARC improves model fairness by localizing risk guarantees.

problem Improving model fairness in tasks like image segmentation and wireless networks.
method Localized Adaptive Risk Control (L-ARC) updates a threshold function in RKHS to target localized statistical risk guarantees.
result L-ARC produces prediction sets with improved fairness across different data subpopulations.

In this study, we give the relationships between the conical curvatures of ruled surfaces drawn by the unit vectors of the ruling, central normal and central tangent of a regular ruled surface in the Euclidean -space. We obtain the differential equations characterizing slant ruled surfaces and if the reference ruled su…

2013-11-27abs ↗pdf ↗

New framework learns interpretable rule ensembles without sacrificing accuracy.

problem Trade-off between accuracy and interpretability in rule ensembles.
method Introduces local interpretability and a regularizer to promote it, using coordinate descent with local search.
result Learns rule ensembles with fewer rules to explain individual predictions, maintaining comparable accuracy.

Framework uses dropout to efficiently explore Rashomon set for multiplicity estimation.

problem Efficiently measuring and mitigating conflicting model outputs in classification tasks.
method Dropout-based exploration of Rashomon set for multiplicity estimation.
result Framework outperforms baselines in multiplicity metric estimation with significant runtime speedup.

Paper classifies ruled surfaces in Lorentz-Minkowski space for a specific flow.

problem Classifying ruled surfaces in Lorentz-Minkowski space.
method Examining homothetic self-similar solutions of the inverse mean curvature flow.
result Existence of two classes of non-cylindrical homothetic solitons.

In this study, we define some new types of ruled surfaces called slant ruled surfaces. We give some characterizations for a regular ruled surface to be a slant ruled surface in Euclidean 3- space. We show that if the slant ruled surface is developable then the striction curve is a general helix or a slant helix accordi…

2013-11-04abs ↗pdf ↗

In this article supervised learning problems are solved using soft rule ensembles. We first review the importance sampling learning ensembles (ISLE) approach that is useful for generating hard rules. The soft rules are then obtained with logistic regression from the corresponding hard rules. In order to deal with the p…

2012-05-21abs ↗pdf ↗

Advances rule-based multi-label classification using conformal prediction.

problem Improving accuracy and decision making in multi-label classification.
method Combines conformal prediction with rule-based learning to provide natural conformity scores and calibrate rule assessments.
result Calibrated conformity scores enhance prediction accuracy and decision making.

In this paper, we consider non developable ruled surface with spacelike ruling, timelike ruling, respectively. We give the relations between the structure functions with the curvature and torsion of the striction line of the timelike and spacelike non developable ruled surfaces. Also, we have calculated the gaussian an…

2014-03-05abs ↗pdf ↗

The Lamarle Formula, given by Kruppa in \cite{Kr}, is known as a relationship between the Gaussian curvature and the distribution parameter of a ruled surface in the surface theory. The ruled surfaces were investigated in 3 different classes with respect to the character of base curves and rulings, \cite{Tu1},\cite{Tu2…

2010-01-05abs ↗pdf ↗

In this study, we introduce Darboux slant ruled surfaces in the Euclidean 3-space which is defined by the property that the Darboux vector of orthonormel frame of ruled surface makes a constant angle with a fixed, non-zero direction. We obtain the characterizations of Darboux slant ruled surfaces regarding the conical …

2013-11-04abs ↗pdf ↗

Generative models learn rules at different timescales, revealing a 'innovation window'.

problem Generative models' convergence to empirical training distribution rather than population distribution.
method Rule-valid synthetic tasks, analyzing τruleτ_{\mathrm{rule}} and τmemτ_{\mathrm{mem}} across training timescales.
result The 'innovation window' widens with increasing dataset size and narrows with rule complexity.

In this study, we define some new types of non-null ruled surfaces called slant ruled surfaces in the Minkowski 3-space E_1^3. We introduce some characterizations for a non-null ruled surface to be a slant ruled surface in E_1^3. Moreover, we obtain some corollaries which give the relationships between a non-null slant…

2016-04-12abs ↗pdf ↗

FedRule uses graph neural networks to recommend rules for smart homes without centralizing data.

problem Manual rule setup for smart devices is inefficient and privacy-compromising.
method FedRule constructs user-specific graphs for rule recommendation, using federated learning to protect privacy.
result FedRule achieves comparable performance to centralized methods and outperforms others.

Paper explores folding patterns of curved creases preserving their geometric properties.

problem Investigating rigid-ruling folding motions of curved crease-rule patterns.
method Deriving conditions for rigid-ruling foldability and analyzing combinations of creases.
result Constant fold-angle creases are only compatible with other constant fold-angle creases.