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

6111722 · May 201919922001200920172026
48 results for MC fusion

Let XX be a non-compact geometrically finite hyperbolic 3-manifold without cusps of rank 1. The deformation space $\mc{H}$ of XX can be identified with the Teichmüller space $\mc{T}$ of the conformal boundary of XX as the graph of a section in $T^*\mc{T}$. We construct a Hermitian holomorphic line bundle $\mc{L}$ on…

2011-02-09abs ↗pdf ↗

MC-CP combines adaptive MC dropout with conformal prediction for robust uncertainty quantification.

problem Deploying deep learning models in safety-critical applications requires reliable confidence estimates.
method MC-CP integrates adaptive Monte Carlo dropout with conformal prediction to improve model performance.
result MC-CP significantly outperforms state-of-the-art UQ methods in both classification and regression tasks.

We determine the homogeneous Kähler diffeomorphism FCFC which expresses the Kähler two-form on the Siegel-Jacobi ball $\mc{D}^J_n=\C^n\times \mc{D}_n$ as the sum of the Kähler two-form on $\C^n$ and the one on the Siegel ball $\mc{D}_n$. The classical motion and quantum evolution on $\mc{D}^J_n$ determined by a hermiti…

2012-04-25abs ↗pdf ↗

We give a homological characterization of nn-manifolds whose universal covering $\Wi M$ has Gromov's macroscopic dimension $\dim_{mc}\Wi M<n$. As the result we distinguish dimmc\dim_{mc} from the macroscopic dimension dimMC\dim_{MC} defined by the author \cite{Dr}. We prove the inequality $\dim_{mc}\Wi M<\dim_{MC}\Wi M=n$ f…

2013-07-03abs ↗pdf ↗

We study the structure of classical groups of equivalences for smooth multigerms f ⁣:(N,S)(P,y)f \colon (N,S) \to (P,y), and extend several known results for monogerm equivalences to the case of mulitgerms. In particular, we study the group $\A$ of source- and target diffeomorphism germs, and its stabilizer $\A_f$. For monogerms $…

2011-10-10abs ↗pdf ↗

ADRL improves participant selection in MCS systems.

problem Designing a participant selection algorithm for different MCS systems with multiple goals.
method Auxiliary-task based deep reinforcement learning (ADRL) using transformers and pointer networks.
result ADRL outperforms other baselines in various MCS settings.

Compressed Monte Carlo improves efficiency in Bayesian inference.

problem Efficiently approximating posterior distributions in Bayesian models.
method Introduces Compressed Monte Carlo (C-MC) to compress statistical information.
result C-MC schemes outperform traditional methods in particle filtering and adaptive IS algorithms.

CST-YOLO improves blood cell detection with YOLOv7 and CNN-Swin Transformer.

problem Small-scale object detection in blood cells.
method YOLOv7 architecture enhanced with CNN-Swin Transformer, W-ELAN, MCS, CatConv.
result CST-YOLO achieves 92.7%, 95.6%, and 91.1% mAP@0.5 on three blood cell datasets.

For a Legendrian knot L in R^3 with a chosen Morse complex sequence (MCS) we construct a differential graded algebra (DGA) whose differential counts "chord paths" in the front projection of L. The definition of the DGA is motivated by considering Morse-theoretic data from generating families. In particular, when the MC…

2011-06-16abs ↗pdf ↗

This study compares MC and QMC methods for likelihood functions.

problem Approximating the normalizing constant of posterior distributions and marginal likelihoods.
method Characterizes the integration error of MC and QMC methods for likelihood functions.
result QMC outperforms MC under certain conditions, especially in high dimensions.

Let MM be a closed surface. By $\Homeo(M)$ we denote the group of orientation preserving homeomorphisms of MM and let $\MC(M)$ denote the Mapping class group. In this paper we complete the proof of the conjecture of Thurston that says that for any closed surface MM of genus $\g \ge 2$, there is no homomorphic sectio…

2008-07-01abs ↗pdf ↗

The memory capacity of linear echo state networks is accurately calculated using new numerical methods.

problem Numerical evaluations of memory capacity in recurrent neural networks often contradict theoretical bounds.
method Developed robust numerical approaches exploiting MC neutrality with respect to the input mask matrix.
result Memory curves fully agree with theory when using the proposed methods.

Constructs Poisson structures on gauge orbits of Maurer-Cartan elements.

problem Tackles constructing Poisson structures on gauge orbits of Maurer-Cartan elements.
method Constructs Poisson structures on gauge orbits of Maurer-Cartan elements of dgla L, associating a compatible Batalin-Vilkovisky algebra to each MC element.
result MCP structures yield a notion of hamiltonian flow of MC elements and define Lie algebroids on gauge orbits.

MC-GMENN improves neural networks for clustered data using Monte Carlo methods.

problem Improving neural network performance on clustered data with correlations.
method MC-GMENN employs Monte Carlo methods to train generalized mixed effects neural networks.
result MC-GMENN outperforms existing models in generalization and quantifying inter-cluster variance.

Meta Fusion integrates various multimodal data fusion strategies into a unified framework.

problem Improving predictive power of machine learning methods across diverse applications.
method Meta Fusion constructs a cohort of models based on latent representations across modalities, sharing soft information to boost performance.
result Meta Fusion consistently outperforms conventional fusion strategies in simulation and real-world applications.

For a fixed smooth map u0u_0 between two Riemann surfaces ΣΣ and SS with non-zero degree, we consider the energy function on Teichmüller space $\mc{T}$ of ΣΣ that assigns to a complex structure $t\in \mc{T}$ on ΣΣ the energy of the harmonic map ut:Σt:=(Σ,t)Su_t:Σ_t:=(Σ,t) \to S homotopic to u0u_0. We prove that the energy fun…

2019-10-23abs ↗pdf ↗

This paper studies the problem of parameter learning in probabilistic graphical models having latent variables, where the standard approach is the expectation maximization algorithm alternating expectation (E) and maximization (M) steps. However, both E and M steps are computationally intractable for high dimensional d…

2016-05-26abs ↗pdf ↗

Posterior refinement improves sample efficiency in Bayesian neural networks.

problem Bayesian neural networks suffer from poor predictive performance due to inaccurate posterior approximations.
method Propose refining Gaussian approximate posteriors with normalizing flows to improve predictive distributions.
result Posterior refinement yields competitive predictive performance with minimal computational overhead.

Existing Markov Chain Monte Carlo (MCMC) methods are either based on general-purpose and domain-agnostic schemes which can lead to slow convergence, or hand-crafting of problem-specific proposals by an expert. We propose A-NICE-MC, a novel method to train flexible parametric Markov chain kernels to produce samples with…

2017-06-23abs ↗pdf ↗

Bayesian Neural Networks improve uncertainty modeling in facial emotion recognition.

problem High aleatoric uncertainty and visual ambiguity in facial emotion recognition.
method Bayesian Neural Networks approximated using MC-Dropout, MC-DropConnect, or Ensemble methods.
result Bayesian Neural Networks produce more human-like output probabilities.

A new memory-based fusion layer improves multi-modal deep learning performance.

problem Improving performance of multi-modal deep learning by addressing long-term dependencies.
method Introducing a Memory based Attentive Fusion (MBAF) layer that incorporates both current and long-term dependencies.
result The MBAF layer enhances fusion and improves performance across different modalities and networks.

The excellent performance of representation learning of autoencoders have attracted considerable interest in various applications. However, the structure and multi-local collaborative relationships of unlabeled data are ignored in their encoding procedure that limits the capability of feature extraction. This paper pre…

2019-06-12abs ↗pdf ↗

Enhances uncertainty estimation in medical image segmentation.

problem Frequency-related noise in medical imaging leads to biased uncertainty estimates.
method Extends MC-Dropout to the frequency domain for better uncertainty estimation.
result MC-Frequency Dropout improves calibration and uncertainty in semantic segmentation.

The development of algorithms for unsupervised pattern recognition by nonlinear clustering is a notable problem in data science. Markov clustering (MCL) is a renowned algorithm that simulates stochastic flows on a network of sample similarities to detect the structural organization of clusters in the data, but it has n…

2019-12-27abs ↗pdf ↗

We show that for a sufficiently simple surface SS, a right-angled Artin group A(Γ)A(Γ) embeds into $\Mod(S)$ if and only if ΓΓ embeds into the curve graph $\mC(S)$ as an induced subgraph. When SS is sufficiently complicated, there exists an embedding $A(Γ)\to\Mod(S)$ for some ΓΓ not contained in $\mC(S)$.

2013-10-17abs ↗pdf ↗

Enhances uncertainty estimation in neural networks using Dirichlet-based MC Dropout.

problem Deterministic predictions without uncertainty estimates in neural networks.
method Integrates Dirichlet-based framework within Monte Carlo Dropout.
result Improves quality of uncertainty estimates in deep learning models.