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

1234 · Jun 202019922001200920172026
48 results for SI

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 ↗

Develops a more powerful selective inference method for stepwise feature selection.

problem Loss of power in existing conditional SI methods due to over-conditioning.
method Uses homotopy continuation approach to overcome over-conditioning.
result Shows improved power and efficiency in selective inference for feature selection.

New algorithm improves signal reconstruction from noisy measurements with side information.

problem Reconstructing unknown signals from noisy linear measurements with side information.
method Integrates side information into approximate message passing (AMP) and tracks performance using state evolution.
result AMP-SI performance is accurately predicted by state evolution.

We propose a novel adversarial speaker adaptation (ASA) scheme, in which adversarial learning is applied to regularize the distribution of deep hidden features in a speaker-dependent (SD) deep neural network (DNN) acoustic model to be close to that of a fixed speaker-independent (SI) DNN acoustic model during adaptatio…

2019-04-29abs ↗pdf ↗

Paper extends SI method for detecting CPs in complex systems' frequency domain.

problem Identifying change points in complex systems' frequency domain.
method Extends SI framework to frequency domain using DFT properties and develops valid p-values.
result Reliable detection of genuine CPs with strong statistical guarantees.

SI-CLAD improves clustering-based anomaly detection by controlling false positives.

problem Lack of reliability in clustering-based anomaly detection.
method SI-CLAD (Statistical Inference for CLustering-based Anomaly Detection) using Selective Inference framework.
result SI-CLAD rigorously controls false detection probability below a specified significance level.

Develops new reinforcement learning methods for complex constrained decision-making problems.

problem Complex constrained decision-making problems with a continuum of constraints.
method Proposes semi-infinitely constrained Markov decision processes (SICMDPs) and two reinforcement learning algorithms: SI-CRL and SI-CPO.
result Demonstrates the effectiveness of SI-CRL and SI-CPO in solving complex sequential decision-making tasks.

Let SI(S_g) denote the hyperelliptic Torelli group of a closed surface S_g of genus g. This is the subgroup of the mapping class group of S_g consisting of elements that act trivially on H_1(S_g;Z) and that commute with some fixed hyperelliptic involution of S_g. We prove that the cohomological dimension of SI(S_g) is …

2011-10-03abs ↗pdf ↗

A k-submanifold L of an open n-manifold M is called weakly integrable (WI) [resp. strongly integrable (SI)] if there exists a submersion Φ:M\to R^{n-k} such that L\subset Φ^{-1}(0) [resp. L= Φ^{-1}(0)]. In this work we study the following problem, first stated in a particular case by Costa et al. (Invent. Math. 1988): …

2010-12-20abs ↗pdf ↗

The assumption in the main result of [Peter W. Michor: Basic Differential Forms for Actions of Lie Groups, Proc. AMS 124, 5 (1996) 1633-1642] is removed. Thus: A section of a Riemannian GG-manifold MM is a closed submanifold $\Si$ which meets each orbit orthogonally. It is shown that the algebra of GG-invariant diff…

1995-06-01abs ↗pdf ↗

In this paper we consider on a complete Riemannian manifold MM an immersed totally geodesic hypersurface $\Si$ existing together with an immersed submanifold NN without focal points. No curvature condition is needed. We obtained several connectedness results relating the topologies of MM and $\Si$ which depend on th…

2011-08-08abs ↗pdf ↗

We study minimal graphic functions on complete Riemannian manifolds $\Si$ with non-negative Ricci curvature, Euclidean volume growth and quadratic curvature decay. We derive global bounds for the gradients for minimal graphic functions of linear growth only on one side. Then we can obtain a Liouville type theorem with …

2013-10-08abs ↗pdf ↗

Enhances selective inference for generalized lasso using parametric programming.

problem Low statistical power in selective inference for generalized lasso.
method Parametric programming to compute solution paths and identify model selection events.
result Improves selective inference power and practicality for various problems.

Paper proposes a new method for selective inference in robust regression.

problem Statistical inference after removing outliers identified by robust methods.
method Conditional SI using piecewise-linear homotopy continuation.
result Proposed method is applicable to a wide class of robust regression and outlier detection methods.

Proposes a new method to improve selective inference for Lasso models.

problem Over-conditioning due to conditioning on feature signs in selective inference for Lasso.
method Parametric programming approach to avoid conditioning on signs and identify feature selection events.
result Improves power and practicality of selective inference for Lasso models.

Study on second homology group of genus 3 hyperelliptic Torelli group.

problem Understanding the structure of second homology group of genus 3 hyperelliptic Torelli group.
method Analyzing abelian cycles associated with disjoint separating curves and their algebraic properties.
result Simple abelian cycles are linearly independent in the second homology group.

Paper introduces PTL-SI for statistical inference in TL-HDR, controlling FPR.

problem Quantifying statistical significance in TL-HDR with limited data.
method PTL-SI framework for valid pp-values in TL-HDR feature selection.
result Valid pp-values and controlled FPR in TL-HDR feature selection.

We give a definition of an integer-valued function iαixi\sum_i α_i x ^*_i derived from arrow diagrams for the ambient isotopy classes of oriented spherical curves. Then, we introduce certain elements of the free Z\mathbb{Z}-module generated by the arrow diagrams with at most ll arrows, called relators of Type~($\check{…

2019-08-16abs ↗pdf ↗

In the context of Multi Instance Learning, we analyze the Single Instance (SI) learning objective. We show that when the data is unbalanced and the family of classifiers is sufficiently rich, the SI method is a useful learning algorithm. In particular, we show that larger data imbalance, a quality that is typically per…

2018-12-17abs ↗pdf ↗

Paper presents a fast and adaptive filter for SI suppression in full-duplex transceivers.

problem Self-interference suppression in full-duplex transceivers with nonlinearity.
method Adaptive projected subgradient method (APSM) in a reproducing kernel Hilbert space (RKHS).
result The proposed method achieves favorable digital SIC performance compared to benchmarks.

Unified understanding of three continual learning regularisation methods.

problem Maintaining knowledge of earlier tasks without re-accessing them.
method Three regularisation approaches: Elastic Weight Consolidation (EWC), Synaptic Intelligence (SI), and Memory Aware Synapses (MAS).
result EWC, SI, and MAS are linked to the same theoretical quantity, the square root of the Fisher Information.

A new method reduces feature screening cost from O(np)O(np) to O(np)O(\sqrt{n}p).

problem Eliminating non-informative features in ultrahigh-dimensional datasets.
method Adaptive subsampling method based on multi-armed bandit problem.
result The proposed method retains sure screening property and comparable performance to SIS.

Let (M,g)(M,g) be a compact Riemannian manifold of dimension n3n\geq 3. For a metric gg on MM, we let $\la_2(g)$ be the second eigenvalue of the Yamabe operator $L_g:= \frac{4(n-1)}{n-2} Δ_g + \scal_g$. Then, the second Yamabe invariant is defined as $$ \si_2(M) \definedas \sup \inf_{h \in [g]} \la_2(h) \Vol(M,h)^{2/n}.…

2012-11-28abs ↗pdf ↗

SETrLUSI combines diverse knowledge from multiple domains for faster convergence.

problem Handling diverse knowledge from multiple domains in transfer learning.
method Stochastic Ensemble Multi-Source Transfer Learning Using Statistical Invariant (SETrLUSI).
result SETrLUSI accelerates convergence and outperforms related methods.

A quantum circuit designed for efficient statistical model preparation and training.

problem Challenges in preparing and learning statistical models on quantum processors.
method Utilizes the maximum entropy principle to design a statistics-informed parameterized quantum circuit (SI-PQC).
result Improves trainability and interpretability for learning quantum states and classical model parameters.

We analyze symmetries in overparametrized neural networks using a mean-field approach.

problem Understanding symmetries in overparametrized neural networks under data symmetry.
method Developed a Mean-Field view of learning dynamics for overparametrized neural networks under data symmetry.
result Symmetric models under data symmetry converge to the space of invariant laws and minimize population risk.

Developed accurate empirical potentials for Si:H nanowires using multi-fidelity Gaussian process.

problem Accurate modeling of Si:H nanowires using fast but inaccurate empirical potentials and slow but accurate first-principle calculations.
method Employed multi-fidelity Gaussian process regression to integrate low-fidelity empirical potential data with high-fidelity first-principle calculations.
result Demonstrated the accuracy of developed empirical potentials for Si:H nanowires.

Stochastic recurrent neural networks with latent random variables of complex dependency structures have shown to be more successful in modeling sequential data than deterministic deep models. However, the majority of existing methods have limited expressive power due to the Gaussian assumption of latent variables. In t…

2019-10-28abs ↗pdf ↗

Paper introduces a method to assess the statistical reliability of changepoints using selective inference and dynamic programming.

problem Assessing the statistical reliability of detected changepoints.
method Selective inference framework combined with dynamic programming for exact p-value computation.
result Proposes a method with high statistical power and decent computational efficiency.

A novel text-independent speaker identification (SI) method is proposed. This method uses the Mel-frequency Cepstral coefficients (MFCCs) and the dynamic information among adjacent frames as feature sets to capture speaker's characteristics. In order to utilize dynamic information, we design super-MFCCs features by cas…

2018-08-02abs ↗pdf ↗

Most structure inference methods either rely on exhaustive search or are purely data-driven. Exhaustive search robustly infers the structure of arbitrarily complex data, but it is slow. Data-driven methods allow efficient inference, but do not generalize when test data have more complex structures than training data. I…

2019-06-17abs ↗pdf ↗

Sharp thresholds and contiguity for community detection in contextual SBM.

problem Community detection in graphs with high-dimensional node-covariates.
method Contextual Stochastic Block Model, non-rigorous cavity method, information theory.
result Established the sharp threshold for detection and weak recovery in the contextual SBM.

DC-SIS selects features faster than mRMR for Parkinson's vocal diagnosis.

problem Feature selection for Parkinson's disease vocal data.
method DC-SIS (Distance Correlation Sure Independence Screening) using distance correlation measure.
result 90 times faster feature selection with similar accuracy.

New method quantifies reliability of neural network image segmentation.

problem Assessing statistical reliability of neural network-based image segmentation results.
method Selective inference framework to compute exact p-values for DNN-driven hypotheses.
result Proposed method successfully controls false positive rate and provides good results for medical image data.

Let $(M,g,\si)$ be a compact Riemannian spin manifold of dimension 2\geq 2. For any metric g~\tilde g conformal to gg, we denote by λ~\tildeλ the first positive eigenvalue of the Dirac operator on $(M,\tilde g,\si)$. We show that $$\inf_{\tilde{g} \in [g]} \tildeλ\Vol(M,\tilde g)^{1/n} \leq (n/2) \Vol(S^n)^{1/n}.$$ T…

2003-08-12abs ↗pdf ↗

In this paper, we propose a two-step training procedure for source separation via a deep neural network. In the first step we learn a transform (and it's inverse) to a latent space where masking-based separation performance using oracles is optimal. For the second step, we train a separation module that operates on the…

2019-10-22abs ↗pdf ↗