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

Trend · papers per month

14284256 · May 202619922001200920172026
48 results for Hearing Recovery

Study predicts hearing recovery in MD patients using TEOAE signals.

problem Predicting hearing recovery in MD patients during acute episodes.
method Applied machine learning to TEOAE signals from MD patients, using SVM for classification.
result Baseline TEOAE parameters can predict hearing recovery in MD patients.

Hearing Aid (HA) algorithms need to be tuned ("fitted") to match the impairment of each specific patient. The lack of a fundamental HA fitting theory is a strong contributing factor to an unsatisfying sound experience for about 20% of hearing aid patients. This paper proposes a probabilistic modeling approach to the de…

2016-02-03abs ↗pdf ↗

CLCNet improves noise reduction in hearing aids with deep learning.

problem Noise reduction in hearing aids is challenging due to real-time and frequency resolution constraints.
method Proposes CLCNet, a deep learning framework based on complex linear coding.
result CLCNet outperforms traditional methods in noisy environments.

We use an extension of Sunada's theorem to construct a nonisometric pair of isospectral simply connected domains in the Euclidean plane, thus answering negatively Kac's question, ``can one hear the shape of a drum?'' In order to construct simply connected examples, we exploit the observation that an orbifold whose unde…

1992-07-01abs ↗pdf ↗

Which properties of an orbifold can we ``hear,'' i.e., which topological and geometric properties of an orbifold are determined by its Laplace spectrum? We consider this question for a class of four-dimensional Kähler orbifolds: weighted projective planes $M:=\C P^2(N_1,N_2,N_3)$ with three isolated singularities. We s…

2006-08-18abs ↗pdf ↗

TinyLSTMs reduces speech enhancement model size and latency for hearing aids.

problem Large RNNs limit practical deployment in hearing aid hardware.
method Model compression techniques (pruning, integer quantization, state update skipping) for RNN speech enhancement.
result Reduction in model size and operations by 11.9imes imes and 2.9imes imes, respectively, without perceptual degradation.

To a compact hyperbolic Riemann surface, we associate a finitely summable spectral triple whose underlying topological space is the limit set of a corresponding Schottky group, and whose ``Riemannian'' aspect (Hilbert space and Dirac operator) encode the boundary action through its Patterson-Sullivan measure. We prove …

2007-08-03abs ↗pdf ↗

A `platycosm' is a flat Riemannian 3-manifold without boundary. In this paper we prove that there is (up to scale) a unique isospectral pair of compact platycosms.

2003-11-26abs ↗pdf ↗

Deep-neural-network (DNN) based noise suppression systems yield significant improvements over conventional approaches such as spectral subtraction and non-negative matrix factorization, but do not generalize well to noise conditions they were not trained for. In comparison to DNNs, humans show remarkable noise suppress…

2018-06-01abs ↗pdf ↗

We give a number of examples of isospectral pairs of plane domains, and a particularly simple method of proving isospectrality. One of our examples is a pair of domains that are not only isospectral but homophonic: Each domain has a distinguished point such that corresponding normalized Dirichlet eigenfunctions take eq…

2010-05-11abs ↗pdf ↗

We answer Mark Kac's famous question, "can one hear the shape of a drum?" in the positive for orbifolds that are 3-dimensional and 4-dimensional lens spaces; we thus complete the answer to this question for orbifold lens spaces in all dimensions. We also show that the coefficients of the asymptotic expansion of the tra…

2017-04-25abs ↗pdf ↗

Take a torus with a Riemannian metric. Lift the metric on its universal cover. You get a distance which in turn yields balls. On these balls you can look at the Laplacian. Focus on the spectrum for the Dirichlet or Neumann problem. We describe the asymptotic behaviour of the eigenvalues as the radius of the balls goes …

2002-02-28abs ↗pdf ↗

In last years, we hear about halal products in non- Muslim societies including European and American ones. In France, for example, sales of halal products sold in stores during the year 2010, increased 23 % and represented 5.5 billion euros, including 1.1 billion for the fast food, and it has not stopped growing since.…

2016-12-01abs ↗pdf ↗

Automatic segmentation of auditory ossicles from CT images using Ricci curvature.

problem Automatic diagnosis of ossicles' diseases from 3D CT images of the head.
method Proposes a completely automatic method that locates and segments ossicles without manual labels or templates, using Ricci curvature in an energy function.
result Performance of the proposed method using discrete Forman-Ricci curvature is superior to state-of-the-art methods.

We answer Mark Kacs famous question - can one hear the shape of a drum - in the negative for orbifolds that are spherical space forms. This is done by extending the techniques developed by A. Ikeda on Lens Spaces to the orbifold setting. Several results are proved to show that with certain restrictions on the dimension…

2009-02-14abs ↗pdf ↗

We uniquely and explicitly reconstruct the instantaneous intrinsic metric of the Kerr-Newman Event Horizon from the spectrum of its Laplacian. In the process we find that the angular momentum parameter, radius, area; and in the uncharged case, mass, can be written in terms of these eigenvalues. In the uncharged case th…

2005-09-28abs ↗pdf ↗

We derive an arbitrage free relationship between recovery swap rates, digital default swap spreads and conventional CDS spreads, and argue that the fair forward recovery rate used in recovery swaps must contain a convexity premium over the expected recovery value.

2010-01-05abs ↗pdf ↗

Standard deep learning systems require thousands or millions of examples to learn a concept, and cannot integrate new concepts easily. By contrast, humans have an incredible ability to do one-shot or few-shot learning. For instance, from just hearing a word used in a sentence, humans can infer a great deal about it, by…

2017-10-27abs ↗pdf ↗

Method uses Seq2Seq learning to automatically generate recovery commands for ICT systems.

problem Manual decision-making for recovery commands is time-consuming and error-prone.
method Seq2Seq neural network model trained on past logs and commands.
result The model can estimate accurate recovery commands from new failures.

Paper shows hyperbolic 3-manifolds can sound the same but have different cohomology.

problem Cannot determine rational cohomology ring from sound of hyperbolic 3-manifolds.
method Implemented computer program to find nullity of cup product map.
result Example of strongly isospectral hyperbolic 3-manifolds with nonisomorphic rational cohomology rings.

A new model explains U- and Swoosh-shaped stock price recovery during the COVID-19.

problem Modeling stock price recovery during the COVID-19 with V- and L-shaped recovery.
method Introducing a sentiment variable θθ to quantify investor sentiment and simulate U- and Swoosh-shaped recovery.
result The model explains U- and Swoosh-shaped recovery of sectoral indices with positive sentiment.

This paper improves support recovery in universal one-bit compressed sensing.

problem Support recovery in one-bit compressed sensing for sparse signals.
method Proposes approximate support recovery and superset recovery algorithms with polynomial-time complexity.
result Achieves improved support recovery with fewer measurements compared to existing methods.

This work provides a guaranteed tensor recovery method by combining low-rankness and smoothness priors.

problem Guaranteed tensor recovery with theoretical guarantees for low-rank and smoothness priors.
method Developed a new regularization term that combines low-rankness and smoothness priors, proving exact recovery guarantees.
result Rigorously proved exact recovery guarantees for tensor completion and tensor robust principal component analysis.

This paper tackles tensor recovery from noisy and multi-level quantized measurements.

problem Tensors from multi-level quantized measurements.
method Nonconvex optimization problem with alternating proximal gradient descent.
result The recovery error diminishes to zero with increasing tensor dimensions.

We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We propose a graph signal model and formulate signal recovery as a cor…

2014-11-26abs ↗pdf ↗

IRKSN algorithm achieves sparse recovery with wider applicability conditions.

problem Sparse recovery challenges due to NP-hard nature and restrictive conditions.
method IRKSN algorithm based on kk-support norm regularizer.
result Achieves sparse recovery with explicit constants and standard linear rate.

Study reveals how to determine area and curvature from fluid flow resonances.

problem Determining geometric properties from fluid flow data.
method Asymptotic expansion of heat kernel and Steklov spectral invariants.
result Area and total mean curvature can be inferred from Steklov eigenvalues.

Study finds the cutoff for exact recovery in Gaussian mixture models.

problem Determining the separation of cluster centers for exact recovery in Gaussian mixture models.
method Used information theory and SDP relaxation of KK-means clustering.
result Sharp threshold for exact recovery of cluster labels without assuming cluster center symmetry.

In recent years research on credit risk modelling has mainly focused on default probabilities. Recovery rates are usually modelled independently, quite often they are even assumed constant. Then, however, the structural connection between recovery rates and default probabilities is lost and the tails of the loss distri…

2011-02-23abs ↗pdf ↗

Study optimal portfolio selection with Recovery Average Value at Risk, showing better control over liabilities.

problem Optimizing portfolios with a new risk measure under known or uncertain distributions.
method Existence results for mean-risk optimal portfolios under different distributional assumptions.
result Portfolio selection under Recovery Average Value at Risk provides better control over liabilities.

The paper improves conditions for unique recovery in homomorphic sensing of subspaces.

problem Unique recovery of points in a linear subspace from their images under linear maps.
method Tighter and simpler conditions for unique recovery in single and subspace arrangement cases, extending to noise stability.
result Conditions for unique recovery in homomorphic sensing are improved and unified.