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

2356 · Mar 202019922001200920172026
48 results for MS

We show that $|MS(L_1 # L_2)|=|MS(L_1)|\times|MS(L_2)|\times\mathbb{R}$ when L1L_1 and L2L_2 are any non-split and non-fibred links. Here MS(L)MS(L) denotes the Kakimizu complex of a link LL, which records the taut Seifert surfaces for LL. We also show that the analogous result holds if we study incompressible Seifert s…

2011-09-05abs ↗pdf ↗

Pricing and hedging rainbow options using Bayesian MS-VAR process.

problem Pricing and hedging rainbow options under varying economic conditions.
method Bayesian Markov-Switching Vector Autoregressive (MS-VAR) process to model regime-switching economic variables.
result Model provides a simpler and more economic variable-dependent approach for rainbow options pricing and hedging.

The paper determines the structure of Kakimizu complexes for genus one hyperbolic knots.

problem Understanding the structure of Kakimizu complexes for genus one hyperbolic knots.
method Analyzing the simplicial complex of minimal genus Seifert surfaces in the exterior of the knots.
result The Kakimizu complex for genus one hyperbolic knots consists of a single dd-simplex for d=0,4d=0,4 and otherwise of at most two dd-simplices which intersect in a common (d1)(d-1)-face.

Selective prediction framework reduces errors in molecular structure identification from MS/MS.

problem High-stakes applications require reliable molecular structure identification from MS/MS data.
method Selective prediction framework using risk-coverage tradeoff and uncertainty quantification.
result First-order confidence measures and retrieval-level aleatoric uncertainty achieve strong risk-coverage tradeoffs.

Improved inter-scanner MS lesion segmentation through adversarial training.

problem Variability in MRI scanner or protocol differences affect automated lesion segmentation accuracy.
method Trained a CNN base model and a discriminator model adversarially on multi-scanner longitudinal data.
result Adversarial training improves inter-scanner consistency of lesion segmentations.

This study investigates the content of the published scientific literature in the fields of operations research and management science (OR/MS) since the early 1950s. Our study is based on 80,757 published journal abstracts from 37 of the leading OR/MS journals. We have developed a topic model, using Latent Dirichlet Al…

2015-10-17abs ↗pdf ↗

CRBM generates digital twins for MS patients, aiding in disease progression analysis.

problem Characterizing and analyzing disease progression in MS patients.
method Unsupervised machine learning with Conditional Restricted Boltzmann Machines (CRBMs).
result Generated digital twins are statistically indistinguishable from actual subjects.

The paper studies the topology of spherical tori with one conical point.

problem Determining the topology of surfaces with constant curvature and conical points.
method Analyzing the moduli space of genus one surfaces with a conical point of specific angles.
result The moduli space topology depends on the integer m>0m>0 for ϑ(2m1,2m+1)\vartheta\in (2m-1,2m+1), and it has a complex structure for ϑ=2m\vartheta=2m.

KL-MS improves regret bounds for multi-armed bandits with bounded rewards.

problem Designing efficient exploration algorithms for multi-armed bandits with bounded rewards.
method Kullback-Leibler Maillard Sampling (KL-MS) for multi-armed bandits with bounded rewards.
result KL-MS achieves a worst-case regret bound of O(μ(1μ)KTlnK+KlnT)O(\sqrt{μ^*(1-μ^*) K T \ln K} + K \ln T).

A new method selects regions of interest in GC-MS data without prior target selection.

problem Challenges in GC-MS data analysis due to fragmentation and shared fragment ions.
method Uses a pseudo F-ratio moving window (ψψFRMV) to automatically select regions of interest.
result Algorithm can accurately identify signal regions in GC-MS data.

Let $(M,g,\si)$ be a compact spin manifold of dimension n2n \geq 2. Let λ1+(g~)λ_1^+(\tilde{g}) be the smallest positive eigenvalue of the Dirac operator in the metric g~[g]\tilde{g} \in [g] conformal to gg. We then define $\lamin(M,[g],\si) = \inf_{\tilde{g} \in [g]} λ_1^+(\tilde{g}) \Vol(M,\tilde{g})^{1/n} $. We show that $…

2007-05-18abs ↗pdf ↗

Bayesian MS-VAR model for pricing equity-linked life insurance products.

problem Pricing and hedging equity-linked life insurance products on maximum of several assets.
method Introduces Bayesian Markov-Switching Vector Autoregressive (MS-VAR) process to model economic variables and insured's lifetime.
result Obtains net single premiums and hedging formulas for equity-linked life insurance products.

Proposes LRR and LRLR for improving stock prediction accuracy.

problem Improving stock prediction accuracy through nonparametric classification.
method Local radial regression and logistic regression variant.
result LRLR outperforms LPoR and MS-kk-NN in real-world stock datasets.

Many proteoforms - arising from alternative splicing, post-translational modifications (PTMs), or paralogous genes - have distinct biological functions, such as histone PTM proteoforms. However, their quantification by existing bottom-up mass-spectrometry (MS) methods is undermined by peptide-specific biases. To avoid …

2017-08-05abs ↗pdf ↗

Classifiers and beamforming algorithms improved audio surveillance detection accuracy.

problem Detecting surveillance sound events with high accuracy and efficiency.
method Evaluated seven classifiers and two beamforming algorithms; used data augmentation and tested with varying SNR levels.
result SVM and Delay-and-Sum (DaS) combination achieved the highest accuracy (86.0%), but had high computational cost.

Study a specific line arrangement and compute its fundamental group via braid monodromy.

problem Compute the fundamental group of a specific line arrangement's complement.
method Use braid monodromy to compute the fundamental group.
result The resulting presentation of the fundamental group coincides with the modified Artin presentation.

This study presents a new lossy image compression method that utilizes the multi-scale features of natural images. Our model consists of two networks: multi-scale lossy autoencoder and parallel multi-scale lossless coder. The multi-scale lossy autoencoder extracts the multi-scale image features to quantized variables a…

2018-05-16abs ↗pdf ↗

GT estimator shows convergence for Markov samples, improving i.i.d. results.

problem Estimating missing mass in Markov samples.
method Analyzed convergence of Good-Turing estimator for Markov samples, considering spectral properties of transition matrices.
result The convergence of the GT estimator for Markov samples depends on the spectral properties of the transition matrices, leading to a new minimax rate of 1/(nβ5)1/(nβ^5) for rank-2 Markov chains.

Todays interactive devices such as smart-phone assistants and smart speakers often deal with short-duration speech segments. As a result, speaker recognition systems integrated into such devices will be much better suited with models capable of performing the recognition task with short-duration utterances. In this pap…

2019-07-22abs ↗pdf ↗

Let MM be a smooth compact manifold and PP be either R1R^1 or S1S^1. There is a natural action of the groups Diff(M)Diff(M) and Diff(M)×Diff(P)Diff(M) \times Diff(P) on the space of smooth mappings C(M,P)C^{\infty}(M,P). For fC(M,P)f\in C^{\infty}(M,P) let SfS_f, SMPS_{MP}, OfO_f, and OMPO_{MP} be the stabilizers and orbits of ff under these ac…

2005-03-31abs ↗pdf ↗

Recent deep learning approaches have achieved impressive performance on speech enhancement and separation tasks. However, these approaches have not been investigated for separating mixtures of arbitrary sounds of different types, a task we refer to as universal sound separation, and it is unknown how performance on spe…

2019-05-08abs ↗pdf ↗

Learning the minimum/maximum mean among a finite set of distributions is a fundamental sub-task in planning, game tree search and reinforcement learning. We formalize this learning task as the problem of sequentially testing how the minimum mean among a finite set of distributions compares to a given threshold. We deve…

2018-06-04abs ↗pdf ↗

Develops an MS-inspired algorithm for regression mode finding and space partitioning.

problem Finding local modes of regression functions and partitioning input space.
method Mean-shift-inspired algorithm for iterative gradient ascent.
result Proves convergence and rates of convergence for estimated local modes.

Real-time semantic segmentation for autonomous vehicles on FPGA reduces latency and power consumption.

problem Efficient real-time semantic segmentation for autonomous vehicles.
method Compressed ENet architecture, FPGA deployment, batch processing, filter reduction, quantization-aware training.
result Reduced latency to 3 ms per image with batch size of ten and 40% resource utilization.