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

Trend · papers per month

17345067 · Jun 202019922001200920172026
48 results for Tannakian reconstruction

The paper uses Tannakian reconstruction to understand hyperbolic log-orbi curves.

problem Understanding the structure of hyperbolic log-orbi curves.
method Formulates hyperbolic uniformization as a Tannakian reconstruction theorem and constructs a canonical maximal parahoric PSL2-Higgs object.
result Reconstructs the absolute Galois group of a one-variable complex function field as the inverse limit of etale fundamental groups of orbifold models.

Study of Tannakian categories for integrable connections on Kaehler manifolds.

problem Understanding Tannakian categories for integrable connections on Kaehler manifolds.
method Analyzing pairs (E, D) where E is a trivial holomorphic vector bundle and D is an integrable holomorphic connection.
result The pro-algebraic affine group scheme uniquely determines the isomorphism class of compact Riemann surfaces.

Let PP be a parabolic subgroup of a connected simply connected complex semisimple Lie group GG. Given a compact Kähler manifold XX, the dimensional reduction of GG-equivariant holomorphic vector bundles over X×G/PX\times G/P was carried out by the first and third authors. This raises the question of dimensional reduct…

2016-09-13abs ↗pdf ↗

The paper classifies Lie algebroids and their connections, modulating principal objects.

problem Classifying and studying Lie algebroids and their connections.
method Classifying integrable transitive Lie algebroids, introducing Higgs bundles, and using Tannakian categories.
result Moduli spaces of principal \(G\)-bundles and Higgs bundles are semiprojective varieties.

We propose two new approaches to the Tannakian Galois groups of holonomic D-modules on abelian varieties. The first is an interpretation in terms of principal bundles given by the Fourier-Mukai transform, which shows that they are almost connected. The second constructs a microlocalization functor relating characterist…

2016-04-08abs ↗pdf ↗

The study constructs differential systems on Riemann surfaces and explores their monodromy properties.

problem Constructing holomorphic differential systems with specific monodromy properties.
method Exploring the monodromy of holomorphic differential systems on Riemann surfaces.
result Holomorphic maps from Riemann surfaces to quotient spaces exist without factoring through elliptic curves.

An axiomatic approach to signal reconstruction is formulated, involving a sample consistent set and a guiding set, describing desired reconstructions. New frame-less reconstruction methods are proposed, based on a novel concept of a reconstruction set, defined as a shortest pathway between the sample consistent set and…

2017-02-02abs ↗pdf ↗

We focus on an interpolation method referred to Bayesian reconstruction in this paper. Whereas in standard interpolation methods missing data are interpolated deterministically, in Bayesian reconstruction, missing data are interpolated probabilistically using a Bayesian treatment. In this paper, we address the framewor…

2014-04-23abs ↗pdf ↗

The paper discusses algorithms for reconstructing curves with given Euclidean or affine curvatures.

problem Reconstructing planar curves with specified Euclidean or affine curvatures.
method The paper presents algorithms for curve reconstruction under the special Euclidean and equi-affine groups.
result The reconstructed curves are close to the original curves in terms of the specified curvatures.

IAGAN method improves medical image reconstruction by incorporating adaptive GAN priors.

problem Reconstructing high-fidelity medical images from incomplete data.
method Image-adaptive GAN-based reconstruction method (IAGAN).
result IAGAN can recover fine structures relevant for medical diagnosis.

This work improves understanding of neural network reconstruction attacks and distillation.

problem Understanding and mitigating reconstruction attacks on neural networks.
method Developed a stronger dataset reconstruction attack and studied its characteristics.
result Reconstruction attacks can recover entire training sets in the infinite width regime.

GCVAE improves disentanglement in VAEs while balancing reconstruction error.

problem Improving disentanglement in VAEs while maintaining low reconstruction error.
method Introduces three controllable Lagrangian hyperparameters to optimize reconstruction and KL divergence loss.
result GCVAE outperforms state-of-the-art models in disentanglement while balancing reconstruction.

Paper proposes RAN for better anomaly detection in time series data.

problem Anomaly detection algorithms often fail to accurately detect anomalies due to incomplete reconstruction of anomaly data.
method RAN uses adversarial learning and latent vector-constrained Autoencoder to ensure consistent reconstruction of anomaly data.
result RAN outperforms other algorithms in detecting meaningful anomalies with higher AUC-ROC scores.

This work improves data reconstruction methods by ensuring unique solutions and refining optimization.

problem Ensuring unique solutions and optimizing reconstruction from KKT conditions.
method Discussion of sufficient conditions for unique solutions and introduction of sample splitting for optimization.
result Sample splitting improves reconstruction performance across various methods.

New condition for reconstructing Morse functions on 3D manifolds.

problem Reconstructing Morse functions with specific level sets.
method Studied a necessary and sufficient condition for reconstruction.
result New condition strengthens previous sufficient conditions.

DCAE learns compact latent representations for one-class novelty detection.

problem Learning compact latent representations for one-class novelty detection.
method DCAE learns compact and collapse-free latent representations through internal discriminative layers of GANs, reconstructing in-class data finely and exclusively.
result DCAE achieves state-of-the-art performance on novelty and adversarial example detection.

Noise2Filter improves 3D tomography reconstruction efficiency and accuracy.

problem Efficiently reconstructing 3D tomographic images in real-time with limited data.
method Self-supervised learning and a learned filter method.
result Noise2Filter achieves real-time reconstruction with limited loss of accuracy.

Single linear solve combines surface reconstruction and uncertainty quantification.

problem Reconstructing surfaces from partial point clouds with uncertainty.
method Geometric Gaussian processes for stochastic surface reconstruction.
result Single linear solve for surface reconstruction with probabilistic capabilities.

Paper tackles model vulnerabilities by reconstructing training data.

problem Reconstructing training data from model parameters poses a security risk.
method Developed a mathematical framework and score matching method for both Bayesian and non-Bayesian models.
result First score matching framework for reconstructing data in Bayesian models.

DEER network improves few-view breast CT image reconstruction efficiency and quality.

problem Efficient and high-quality few-view breast CT image reconstruction.
method Deep Efficient End-to-end Reconstruction (DEER) network with low model complexity.
result DEER network achieves competitive image quality with significantly fewer parameters compared to state-of-the-art methods.

Study shows how numerical discretization affects reconstructions and parameter distributions in nano metrology.

problem Impact of numerical discretization on parameter reconstructions and model parameter distributions.
method Bayesian target vector optimization, finite element model, Gaussian process, stochastic machine learning surrogate models, Markov chain Monte Carlo sampler.
result Numerical discretization parameters impact the accuracy and distribution of reconstructed model parameters.

Improves MRI-based brain surface reconstruction with minimal deformation energy loss.

problem Ensuring optimal deformation energy and consistency in learning-based cortical surface reconstruction.
method Design and implementation of a Minimal Energy Deformation (MED) loss in the V2C-Flow model.
result Significant improvements in training consistency and reproducibility without sacrificing reconstruction accuracy and topological correctness.

SaR-SVM-STV improves hyperspectral image classification with shape-adaptive reconstruction and denoising.

problem Classifying hyperspectral images with limited labeled data.
method Shape-adaptive Reconstruction (SaR) for pixel preprocessing, SVM for probability estimation, and Smoothed Total Variation (STV) for denoising.
result SaR-SVM-STV outperforms SVM-STV with fewer labeled data.

Improved particle-flow event reconstruction for future colliders using scalable neural networks.

problem Efficient and accurate particle reconstruction in future particle detectors.
method Comparative study of scalable machine learning models (graph neural network and kernel-based transformer) for event reconstruction.
result Graph neural network model improves jet transverse momentum resolution by up to 50%.

Generative adversarial networks reconstruct MRI images without full data.

problem Lack of fully-sampled ground truth data for supervised MRI reconstruction.
method Generative adversarial networks for unsupervised MRI reconstruction.
result Reconstructed images show more anatomical structure than conventional methods.

New model reconstructs flow from sparse data with uncertainty quantification.

problem Reconstructing nonlinear flow from limited observations.
method Semi-Conditional Variational Autoencoder (SCVAE) for probabilistic flow reconstruction.
result SCVAE improves reconstruction accuracy compared to Gappy Proper Orthogonal Decomposition (GPOD).

Fast and accurate MRI image reconstruction from undersampled data is crucial in clinical practice. Deep learning based reconstruction methods have shown promising advances in recent years. However, recovering fine details from undersampled data is still challenging. In this paper, we introduce a novel deep learning bas…

2019-12-02abs ↗pdf ↗

Paper defines AI-specific loss reconstruction problem and introduces CER framework.

problem Reconstructing AI-generated losses, especially in agentic systems.
method CER framework: C (control boundary), E (evidence reconstruction), R (insurance response).
result Defines AI-specific reconstruction problem and operationalizes it.

Deep learning models reconstruct volatility surfaces from noisy data under no-arbitrage constraints.

problem Reconstructing implied volatility surfaces from sparse and noisy option quotes.
method Compared multiple neural architectures including Transformers, U-Nets, and variational autoencoders.
result Transformer and U-Net architectures achieve strong reconstruction accuracy, especially under sparse observation regimes.

CNN improves neutrino event reconstruction in IceCube DeepCore.

problem Difficulties in distinguishing muon neutrinos and reconstructing inelasticity at GeV scale energies.
method 2D Convolutional Neural Network exploiting time and depth translational symmetry.
result CNN model outperforms conventional methods for flavor identification and inelasticity reconstruction.

New study analyzes security of neural network data reconstruction attacks.

problem Data reconstruction attacks pose a threat to private training data.
method Analyzes security boundary of data reconstruction attacks via neuron exclusivity state.
result Characterizes insecure/secure boundary of data reconstruction attacks.

Study reconstructs Morse-Bott functions with specific preimage conditions on 3D manifolds.

problem Reconstructing Morse-Bott functions with prescribed preimages on 3D manifolds.
method Conditions and approach based on previous work by Sharko and others.
result New result on reconstruction of nice smooth functions with specified preimages.

A new method for the unsupervised learning of sparse representations using autoencoders is proposed and implemented by ordering the output of the hidden units by their activation value and progressively reconstructing the input in this order. This can be done efficiently in parallel with the use of cumulative sums and …

2016-05-05abs ↗pdf ↗

This paper is concerned with the question of reconstructing a vector in a finite-dimensional real Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We analyze various Lipschitz bounds of the nonlinear analysis map and we establish theoretical performance bo…

2013-08-21abs ↗pdf ↗

New method improves model reconstruction using counterfactuals and polytope theory.

problem Reconstructing models with minimal input changes and avoiding decision boundary shifts.
method Using polytope theory to derive loss functions that treat counterfactuals differently from ordinary instances.
result Improves fidelity between target and surrogate model predictions on multiple datasets.

Jointly correct bias fields and reconstruct undersampled MRI images.

problem Recovering fully sampled MRI images from undersampled data while accounting for bias field differences.
method An unsupervised learning-based reconstruction algorithm combined with a N4-based bias field estimation method in a joint optimization scheme.
result The proposed method improves reconstruction quality, both visually and in terms of RMSE.

Reconstruction based subspace clustering methods compute a self reconstruction matrix over the samples and use it for spectral clustering to obtain the final clustering result. Their success largely relies on the assumption that the underlying subspaces are independent, which, however, does not always hold in the appli…

2012-06-18abs ↗pdf ↗