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

71142213284 · Jun 202019922001200920182026
48 results for IoU loss

A new framework for consistent segmentation evaluation reduces operating losses.

problem Inconsistent thresholding-based segmentation methods lead to suboptimal solutions.
method Developed a consistent ranking-based framework (RankDice/RankIoU) using Bayes rules and Dice-/IoU-calibration.
result The proposed framework is Dice-/IoU-calibrated and provides excess risk bounds and convergence rates.

New risk control method for non-monotonic losses in complex parameters.

problem Controlling risk for non-monotonic losses with multidimensional parameters.
method Stability-based guarantees for generic algorithms applied to non-monotonic losses.
result Guarantees depend on algorithm stability, with looser guarantees for unstable algorithms.

Method meta-classifies semantic segmentation predictions using dispersion measures.

problem Assessing the quality of semantic segmentation predictions.
method Aggregates dispersion measures (entropy) of predicted probabilities to derive metrics correlated with IoU.
result Metrics correlate well with IoU, providing reliable prediction quality ratings.

A benchmark evaluates ioUS-to-MR synthesis methods for brain tumor surgery.

problem Difficult interpretation of ioUS images for brain tumor surgery.
method Six generators trained under four inference regimes and two targets on public data.
result SynDiff-2.5D best preserved downstream segmentation (U_Dice=0.55).

Method generates uncertainty measures for street scene segmentation.

problem Reliability and uncertainty measures in semantic segmentation of street scenes.
method Nested crops, neural network segmentation, post-processing, uncertainty heat maps.
result Significant improvements in classification and regression performance.

A novel feedbackward approach for semantic segmentation reduces parameter count.

problem Semantic segmentation challenges in terms of model complexity and performance.
method Reverse-direction encoder-decoder architecture using the same network for both encoding and decoding.
result Significantly outperforms other models using only 13 VGG-16 layers, achieving higher IoU scores.

SCENE-Net improves 3D point cloud segmentation with low resource usage and transparency.

problem Lack of resources and transparency in 3D semantic segmentation models.
method SCENE-Net uses signature shapes identified via GENEOs to achieve semantic segmentation with minimal resources.
result SCENE-Net achieves comparable IoU to state-of-the-art methods with less data and computational resources.

ACNN improves medical image segmentation with full resolution and higher IoUs.

problem Reduced spatial resolution in current DCNNs hinders medical image segmentation.
method Proposes ACNN using atrous convolution, cascaded atrous II-blocks, residual learning, and Instance Normalization.
result ACNN achieves higher IoUs than U-Net and Deeplabv3+ with fewer parameters.

AMI-Net+ tackles medical diagnosis from incomplete, imbalanced data.

problem Medical diagnosis from incomplete and imbalanced data.
method AMI-Net+ uses multi-instance neural network with embedding, multi-head attention, and gated attention-based pooling. It also employs focal loss and self-adaptive multi-instance pooling.
result AMI-Net+ outperforms state-of-the-art models on real-world medical datasets.

RankSEG-RMA improves semantic segmentation efficiency and applicability.

problem Inconsistent or suboptimal semantic segmentation results due to argmax or thresholding.
method Developed RankSEG-RMA using reciprocal moment approximation to optimize Dice and IoU metrics.
result RankSEG-RMA reduces computational complexity to O(d) while maintaining comparable performance.

Algorithm generates adaptive confidence sets for instance segmentation with guaranteed coverage.

problem Uncalibrated predictions and lack of uncertainty quantification in instance segmentation models.
method Conformal prediction algorithm to generate adaptive confidence sets with provable guarantees.
result Empirically, prediction sets vary in size based on query difficulty and attain target coverage, outperforming baselines.

CRAUM-Net improves salient object detection with context and uncertainty modeling.

problem Accurate salient object detection with precise boundary delineation.
method Contextual Recursive Attention with Uncertainty Modeling, multi-scale context aggregation, attention mechanisms, edge-aware decoder, Monte Carlo Dropout.
result Superior performance in producing accurate and reliable saliency maps.

New unbiased variance estimator for random forests using Hoeffding decomposition.

problem Uncertainty quantification in random forests with large kernel sizes and small sample sizes.
method Proposes a new Hoeffding decomposition view for variance estimation, establishing unbiased estimators and ratio consistency.
result Establishes the ratio consistency of the proposed variance estimator, justifying confidence interval coverage rates.

RETR improves indoor radar perception with a novel transformer model.

problem Indoor radar perception lacks models tailored for multi-view radar settings.
method RETR extends DETR architecture with depth-prioritized feature similarity, tri-plane loss, and radar-to-camera transformation.
result RETR outperforms state-of-the-art methods by 15.38+ AP for object detection and 11.91+ IoU for instance segmentation.

AI tool automates blood segmentation from head CT scans after SAH.

problem Accurate volumetric assessment of SAH patients for clinical and prognostic implications.
method Transformer-based Swin UNETR architecture for noncontrast CT scans.
result High accuracy and robust performance across internal and external validation cohorts.

Bayesian variational inference improves medical image segmentation confidence.

problem Improving interpretability and confidence in deep learning models for medical image segmentation.
method Encoder-decoder architecture based on variational inference for segmenting brain tumor images.
result The model segments brain tumors with both aleatoric and epistemic uncertainty.

The paper improves CNN models for polyp segmentation, enhancing their accuracy and interpretability.

problem Uncertainty and interpretability in CNNs for medical image analysis.
method Develop and evaluate recent advances in uncertainty estimation and model interpretability in FCNs for polyp segmentation.
result Highest performing model achieves 76.06% mean IOU accuracy on the EndoScene dataset.

CBDA improves active learning for semantic segmentation, especially with imbalanced classes.

problem Class imbalance degrades performance in domain adaptive active learning.
method Class Balanced Dynamic Acquisition (CBDA) selects more balanced labels for active learning.
result CBDA increases minority class performance and outperforms baselines by 0.6-2.4 mIoU.

New method mitigates bias without sensitive data using causal graph and variational autoencoder.

problem Lack of fairness strategies when sensitive attributes are not collected.
method SRCVAE framework based on causal graph for inferring a proxy sensitive attribute.
result Significant improvements in fairness metrics over existing methods.

Proposes MSFCN and RFCN for video semantic segmentation improving accuracy by 9-15%.

problem Lack of temporal information in semantic segmentation algorithms for videos.
method Integrates motion cues and temporal consistency using recurrent and multi-stream FCN architectures.
result MSFCN-3 achieves significant accuracy improvements in various datasets.

TokenCut detects and segments objects in images and videos without supervision.

problem Detecting and segmenting salient objects in images and videos without labeled data.
method Graph-based approach using self-supervised transformer features and Normalized Cut algorithm.
result Achieves state-of-the-art results on various detection and segmentation tasks.

Paper proposes a method to improve building extraction from aerial images by adapting CNN models.

problem Limited generalization of CNN-based segmentation models for unseen images.
method Combines domain transfer and adversarial attack concepts to adapt input images to target images.
result Improves overall IoU and outperforms other methods in cross-dataset experiments.

Credit networks represent a way of modeling trust between entities in a network. Nodes in the network print their own currency and trust each other for a certain amount of each other's currency. This allows the network to serve as a decentralized payment infrastructure---arbitrary payments can be routed through the net…

2010-07-03abs ↗pdf ↗

Convolutional networks fail on coordinate transformations, a CoordConv solution improves performance.

problem Convolutional networks fail on coordinate transformations.
method CoordConv, a solution that gives convolution access to its own input coordinates.
result CoordConv improves performance on various tasks, including GANs, Faster R-CNN, and Atari games.

A new loss function αα-loss bridges log-loss and 00-11 loss for binary classification.

problem Improving binary classification performance using a tunable loss function.
method Introducing αα-loss, proving its margin-based form and classification-calibration, and providing an upper bound on empirical risk.
result Empirical and expected risk difference upper bound for logistic regression-based classification.

We study losses for binary classification and class probability estimation and extend the understanding of them from margin losses to general composite losses which are the composition of a proper loss with a link function. We characterise when margin losses can be proper composite losses, explicitly show how to determ…

2009-12-17abs ↗pdf ↗

Unified surrogate loss framework for multi-label learning with strong consistency guarantees.

problem Improving consistency and accounting for label correlations in multi-label learning.
method Introducing multi-label logistic loss and extending it to comprehensive multi-label comp-sum losses, proving strong consistency guarantees for any multi-label loss.
result Unified surrogate loss framework benefiting from strong consistency guarantees for any multi-label loss.

Visualizes basins of attraction for neural network loss functions.

problem Understanding the nature of neural network loss surfaces and basins of attraction.
method Gradient-based random sampling to visualize basins of attraction and stationary points.
result Entropic loss has a more searchable landscape with fewer stationary points than quadratic loss.

This work generalizes calibeating for a broader range of proper losses using Bregman divergence.

problem Calibration for a wide range of proper losses beyond Brier and log loss.
method Regret minimization based on Bregman divergence for a family of proper losses.
result U-calibration results for a family of Tsallis losses with logarithmic regret and dimension independence.

Proposes squentropy loss for improved classification accuracy and model calibration.

problem Theoretical and empirical evidence for cross-entropy loss is lacking.
method Introduces squentropy loss as the sum of cross-entropy and average square loss over incorrect classes.
result Squentropy loss outperforms cross-entropy and rescaled square losses in classification accuracy and model calibration.

The study analyzes a model for aggregate losses with dependent and overdispersed inter-losses times.

problem Analyzing aggregate loss models with dependent and overdispersed inter-losses times.
method The study uses a two-state Markovian arrival process (MAP2) and a Markov renewal process to model the inter-losses times. Severities are modeled using a heavy-tailed, double-Pareto Lognormal distribution. The model is estimated via direct maximization of the likelihood function.
result The model with dependence and overdispersion in inter-losses times leads to higher capital charges compared to a Poisson process.

Logitron combines Perceptron and logistic loss for improved classification.

problem Non-convex and non-smooth zero-one loss function in classification models.
method Introduces a Perceptron-augmented convex classification framework with an extended logistic loss function.
result Hinge-Logitron outperforms logistic regression and SVM in classification accuracy.