New method unfolds distribution moments directly from data without binning.
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.
Trend · papers per month
New method for unbinned, profiled unfolding in particle physics.
Collider data must be corrected for detector effects ("unfolded") to be compared with many theoretical calculations and measurements from other experiments. Unfolding is traditionally done for individual, binned observables without including all information relevant for characterizing the detector response. We introduc…
A new machine learning method handles nuisance parameters for better unfolding in particle physics.
In this paper, deep neural network (DNN) is utilized to improve the belief propagation (BP) detection for massive multiple-input multiple-output (MIMO) systems. A neural network architecture suitable for detection task is firstly introduced by unfolding BP algorithms. DNN MIMO detectors are then proposed based on two m…
OmniFold uses deep learning to deconvolve high-dimensional simulations.
New algorithm profiles nuisance parameters for multidimensional deconvolution.
A new method for unfolding histograms without matrix inversion.
Study families of Lie algebroids on complex spaces, introducing unfoldings.
Study on unfolding maps of surfaces in 3D space, proving versality conditions.
New deep-unfolded network improves video background separation.
Unfolding paths in Outer space accumulate on a simplex, not converge.
The paper studies phase transitions in random matrices and tensor unfolding for detecting signals.
We show that every convex polyhedron admits a simple edge unfolding after an affine transformation. In particular there exists no combinatorial obstruction to a positive resolution of Durer's unfoldability problem, which answers a question of Croft, Falconer, and Guy. Among other techniques, the proof employs a topolog…
A simple self-supervised model for tensor RPCA using deep unfolding.
In a previous work we proved the uniqueness and functoriality of primary unfoldings on simple Thom-Mather spaces, which is a functor to the category of smooth manifolds. In this article we extend these results for any stratified Thom-Mather pseudomanifold with arbitary finite length, through a new kind of intermediate …
A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in Euclidean 3-space with a pseudo-edge graph with respect to which K is not unfoldable…
This letter presents the sparse vector signal detection from one bit compressed sensing measurements, in contrast to the previous works which deal with scalar signal detection. In this letter, available results are extended to the vector case and the GLRT detector and the optimal quantizer design are obtained. Also, a …
This is mainly a survey article on the recent development of the theory of graph-like Legendrian unfoldings and its applications. The notion of big Legendrian submanifolds was introduced by Zakalyukin for describing the wave front propagations. Graph-like Legendrian unfoldings belong to a special class of big Legendria…
Unified framework for spectral methods, kernel learning, and manifold unfolding.
We review how a reduction procedure along a principal fibration and an unfolding procedure associated to a suitable momentum map allow to describe the Kähler geometry of a finite dimensional complex projective spaces.
Deep unfolding accelerates MCMC-based COP solvers.
New algorithms accelerate SVGD convergence using deep unfolding.
Chebyshev steps improve convergence in deep-unfolded gradient descent.
Adversarial perturbations fool deepfake detectors with high accuracy.
In this paper, we introduce the notions of map-germs of pedal unfolding type and normalized Legendrian map-germs; and then we show that the fundamental theorem of calculus provides a natural one to one correspondence between Whitney umbrellas of pedal unfolding type and normalized swallowtails.
This paper studies concept drift detectors for financial time series.
Develops a Thom-Mather theory for corank 1 frontals.
Let be a closed and oriented -manifold. We define different versions of unfolded Seiberg-Witten Floer spectra for . These invariants generalize Manolescu's Seiberg-Witten Floer spectrum for rational homology -spheres. We also compute some examples when is a Seifert space.
ULES embeds dynamic networks with stability guarantees.
In recent years, unfolding iterative algorithms as neural networks has become an empirical success in solving sparse recovery problems. However, its theoretical understanding is still immature, which prevents us from fully utilizing the power of neural networks. In this work, we study unfolded ISTA (Iterative Shrinkage…
In this work, we consider the use of model-driven deep learning techniques for massive multiple-input multiple-output (MIMO) detection. Compared with conventional MIMO systems, massive MIMO promises improved spectral efficiency, coverage and range. Unfortunately, these benefits are coming at the cost of significantly i…
Branched covers are applied frequently in topology - most prominently in the construction of closed oriented PL d-manifolds. In particular, strong bounds for the number of sheets and the topology of the branching set are known for dimension d<=4. On the other hand, Izmestiev and Joswig described how to obtain a simplic…
Maximum Variance Unfolding is one of the main methods for (nonlinear) dimensionality reduction. We study its large sample limit, providing specific rates of convergence under standard assumptions. We find that it is consistent when the underlying submanifold is isometric to a convex subset, and we provide some simple e…
We explore the use of graph networks to deal with irregular-geometry detectors in the context of particle reconstruction. Thanks to their representation-learning capabilities, graph networks can exploit the full detector granularity, while natively managing the event sparsity and arbitrarily complex detector geometries…
New method uses Wasserstein loss for data unfolding, offering better accuracy than classical techniques.
A procedure for unfolding the true distribution from experimental data is presented. Machine learning methods are applied for simultaneous identification of an apparatus function and solving of an inverse problem. A priori information about the true distribution from theory or previous experiments is used for Monte-Car…
We use the construction of unfolded Seiberg-Witten Floer spectra of general 3-manifolds defined in our previous paper to extend the notion of relative Bauer-Furuta invariants to general 4-manifolds with boundary. One of the main purposes of this paper is to give a detailed proof of the gluing theorem for the relative i…
New method uses neural networks to estimate parameters without needing detector simulations.
The anomaly detection of time series is a hotspot of time series data mining. The own characteristics of different anomaly detectors determine the abnormal data that they are good at. There is no detector can be optimizing in all types of anomalies. Moreover, it still has difficulties in industrial production due to pr…
We introduce a Bayesian defect detector to facilitate the defect detection on the motion blurred images on rough texture surfaces. To enhance the accuracy of Bayesian detection on removing non-defect pixels, we develop a class of reflected non-local prior distributions, which is constructed by using the mode of a distr…
Modern smart grids rely on advanced metering infrastructure (AMI) networks for monitoring and billing purposes. However, such an approach suffers from electricity theft cyberattacks. Different from the existing research that utilizes shallow, static, and customer-specific-based electricity theft detectors, this paper p…
TomOpt optimizes muon detector designs using differentiable programming.
This paper develops a novel deep recurrent neural network for sequential signal reconstruction.
ImageNet pre-training has been regarded as essential for training accurate object detectors for a long time. Recently, it has been shown that object detectors trained from randomly initialized weights can be on par with those fine-tuned from ImageNet pre-trained models. However, the effects of pre-training and the diff…
Improves relevancy of black-box anomaly detectors with user feedback.
A very simple heuristic approach to the unfolding problem will be described. An iterative algorithm starts with an empty histogram and every iteration aims to add one entry to this histogram. The entry to be added is selected according to a criteria which includes a test and a regularization. After a relatively s…
This article is devoted to the study of smooth desingularization, which are customary employed in the definition of De Rham Intersection Cohomology with differential forms. In this paper we work with the category of Thom-Mather simple spaces. We construct a functor which sends each Thom-Mather simple space into a smoot…