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

265379105 · Jun 202019922001200920172026
48 results for wild binary segmentation

Detects changes in topic proportions over time in large text datasets.

problem Unsupervised detection of structural changes in topic distributions over time.
method Specialised temporal topic model with changepoint detection, approximate inference using sample splitting and likelihood ratio statistic.
result Automated detection of changepoints in topic proportions, facilitating interpretable results.

Enhances contrastive learning for better representation learning on wild images.

problem Binary partition of views from same and different instances limits CL's performance.
method Doubly Contrastive Learning (CACR) with contrastive attraction and repulsion.
result CACR improves performance and robustness on wild image datasets.

We study (i) asymptotic behaviour of wild harmonic bundles, (ii) the relation between semisimple meromorphic flat connections and wild harmonic bundles, (iii) the relation between wild harmonic bundles and polarized wild pure twistor DD-modules. As an application, we show the hard Lefschetz theorem for algebraic semis…

2008-03-10abs ↗pdf ↗

This paper constructs wild knots from beaded necklaces using a Schottky group.

problem Creating wild knots from beaded necklaces and studying their properties.
method Using a Schottky group generated by inversions on spheres to construct wild knots.
result The constructed wild knots are fibered if the original knot is fibered.

Study of wild mapping class groups on complex reflection groups.

problem Understanding deformations of wild Riemann surfaces.
method Construction of configuration spaces and combinatorial fission forests.
result Sharp parameterisation of admissible deformation classes of wild Riemann surfaces.

Study of wild mapping class groups and their cabled braids.

problem Understanding the structure of wild mapping class groups and their cabled versions.
method Define and study generalizations of pure g\mathfrak{g}-braid groups, establish product decompositions, and introduce fission trees.
result Obtain cabled versions of braid groups, related to braid operads.

The Gauss-Bonnet formula for classical translation surfaces relates the cone angle of the singularities (geometry) to the genus of the surface (topology). When considering more general translation surfaces, we observe so-called wild singularities for which the notion of cone angle is not applicable any more. We study w…

2014-10-06abs ↗pdf ↗

LoD improves model safety by integrating unlabeled wild data, reducing OOD misclassification.

problem Improving model safety and reliability using unlabeled wild data containing both in-distribution and out-of-distribution samples.
method Intentionally label-noisifying unlabeled wild data to enable joint learning of labeled ID and OOD data, distinguishing losses between ID and OOD samples.
result LoD framework achieves superior OOD detection without requiring thresholds, improving model safety.

TPM improves medical image segmentation by separating foreground and background.

problem Few-shot medical image segmentation challenges due to background variability.
method Tied Prototype Model (TPM) focusing on foreground, adapting thresholds, and using class priors.
result TPM leads to improved segmentation accuracy compared to ADNet.

In this paper we study kleinian groups of Schottky type whose limit set is a wild knot in the sense of Artin and Fox. We show that, if the ``original knot'' fibers over the circle then the wild knot ΛΛ also fibers over the circle. As a consequence, the universal covering of S3Λ\mathbb{S}^{3}-Λ is R3\mathbb{R}^{3}. We p…

2005-09-06abs ↗pdf ↗

A new method for measuring prediction uncertainty in classifiers.

problem Measuring uncertainty of predictions from machine learning methods.
method Density Based Calibration (DBCal) technique.
result Expected calibration error of less than 0.2% on binary classifiers and less than 3% on semantic segmentation networks.

We prove the Kobayashi-Hitchin correspondence between good wild harmonic bundles and polystable good filtered λλ-flat bundles satisfying a vanishing condition. We also study the correspondence for good wild harmonic bundles with the homogeneity with respect to a group action, which is expected to provide another way t…

2019-02-21abs ↗pdf ↗

The performance of the state-of-the-art image segmentation methods heavily relies on the high-quality annotations, which are not easily affordable, particularly for medical data. To alleviate this limitation, in this study, we propose a weakly supervised image segmentation method based on a deep geodesic prior. We hypo…

2019-08-18abs ↗pdf ↗

Voice Onset Time (VOT), a key measurement of speech for basic research and applied medical studies, is the time between the onset of a stop burst and the onset of voicing. When the voicing onset precedes burst onset the VOT is negative; if voicing onset follows the burst, it is positive. In this work, we present a deep…

2019-10-27abs ↗pdf ↗

Improved road segmentation on low-res LIDAR data for autonomous vehicles.

problem Low-resolution LIDAR data affects road segmentation accuracy in autonomous vehicles.
method Subsampled LIDAR data transformation into feature maps, use local normal vector with spherical coordinates.
result Improves road segmentation accuracy on low-resolution LIDAR data.

In this paper we prove that a wild knot KK which is the limit set of a Kleinian group acting conformally on the unit 3-sphere, with its standard metric, is homogeneous: given two points p,qKp, q\in{K} there exists a homeomorphism ff of the sphere such that f(K)=Kf(K)=K and f(p)=qf(p)=q. We also show that if the wild knot is a …

2005-08-26abs ↗pdf ↗

A new method for binary ICA using non-stationary sources.

problem Independent component analysis of binary data.
method Linear mixing model in latent space, followed by binary observation model with non-stationary sources.
result Proves non-identifiability with few observed variables but identifies with more variables.

Piecewise Aggregate Approximation (PAA) is a competitive basic dimension reduction method for high-dimensional time series mining. When deployed, however, the limitations are obvious that some important information will be missed, especially the trend. In this paper, we propose two new approaches for time series that u…

2019-06-28abs ↗pdf ↗

Novel method improves load estimation in power grids using anomaly and change point detection.

problem Improving load estimation in power grid systems.
method Combining unsupervised anomaly and change point detection methods for automatic filtering.
result Automatic load estimation is accurate with 90% estimates within a 10% error margin.

Convolutional neural networks are state-of-the-art for various segmentation tasks. While for 2D images these networks are also computationally efficient, 3D convolutions have huge storage requirements and therefore, end-to-end training is limited by GPU memory and data size. To overcome this issue, we introduce a netwo…

2019-10-23abs ↗pdf ↗

New method refines model-free evaluation of complex machine learning models.

problem Evaluating the excess risk of opaque machine learning predictors.
method Perturbing derivatives to create pseudo-outcomes and refitting the model twice.
result Upper bound on excess risk derived efficiently without prior function class knowledge.

Study compares DL models for medical image segmentation, finds synergistic ensemble strategies improve performance.

problem Improving DL models for specialized medical image segmentation using transfer learning.
method Detailed comparisons of TII and LMI models for binary segmentation of medical images.
result Ensemble strategies improve performance by 10% in certain scenarios.

A wild bootstrap method for nonparametric hypothesis tests based on kernel distribution embeddings is proposed. This bootstrap method is used to construct provably consistent tests that apply to random processes, for which the naive permutation-based bootstrap fails. It applies to a large group of kernel tests based on…

2014-08-23abs ↗pdf ↗

Let CC and DD be a pair of crumpled nn-cubes and hh a homeomorphism of Bd C\text{Bd }C to Bd D\text{Bd }D for which there exists a map fh:CDf_h: C\to D such that fhBd C=hf_h|\text{Bd }C =h and fh1(Bd D)=Bd Cf_{h}^{-1}(\text{Bd }D)=\text{Bd }C. In our view the presence of such a triple (C,D,h)(C,D,h) suggests that CC is "at least as wild as" $D…

2014-11-10abs ↗pdf ↗