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.

169,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Apr 199419922001200920182026
48 results for Neural Egg Separation

New method separates mixed distributions without requiring samples of each source.

problem Separating mixed distributions in machine learning and signal processing.
method Neural Egg Separation method iteratively learns to separate known from unknown distributions.
result Neural Egg Separation outperforms current methods in audio and image separation tasks.

This paper addresses converting speech to EGG signals without hardware, improving accuracy.

problem Estimating EGG signals from speech without hardware.
method Optimization of evidence lower bound with KL-divergence minimization.
result The method generates EGG signals that agree with gold standard and outperforms state-of-the-art.

We discuss the structure of "exceptional generalised geometry" (EGG), an extension of Hitchin's generalised geometry that provides a unified geometrical description of backgrounds in eleven-dimensional supergravity. On a d-dimensional background, as first described by Hull, the action of the generalised geometrical O(d…

2008-04-08abs ↗pdf ↗

LGD breaks the chicken-and-egg loop in adaptive SGD by using LSH sampling.

problem Challenging per-iteration cost of adaptive gradient sampling.
method Locality Sensitive Hashing (LSH) sampled Stochastic Gradient Descent (LGD).
result Superior and faster gradient estimation with similar per-iteration cost.

Paper solves the chicken-and-egg problem in unsupervised learning of signal models.

problem Learning signal models from incomplete data when the model is unknown.
method Necessary and sufficient sensing conditions for learning signal models from multiple measurement operators or group invariance.
result Agrees with the fundamental limitations of learning from incomplete data.

Paper identifies resting positions using EGG, ECG, respiration rate, and SpO2.

problem Identifying the resting position for health monitoring.
method Hybrid stacked ensemble machine learning model combining Decision tree, Random Forest, and Xgboost.
result 100% accurate prediction of resting positions.

Improves deep neural networks using soft labels through alternating minimization.

problem Improving deep neural networks training with soft labels.
method Co-Learns DNNs and soft labels via Alternating Minimization of two objectives.
result COLAM achieves improved performance on many tasks with better testing classification accuracy.

DANCE optimizes neural network and accelerator design for faster, more efficient DNN execution.

problem Challenges in optimizing neural network and accelerator design for efficient DNN execution.
method Differentiable approach to co-exploration of accelerator and network architecture design.
result Significantly shorter time to achieve superior accuracy and hardware cost metrics.

Shallow neural nets classify objects perfectly if their distribution is linearly separable.

problem Designing efficient neural networks for classification.
method Constructed shallow sigmoid-type neural networks.
result Achieves 100% accuracy for datasets following a linear separability condition.

We present a modification of the so-called Parrondo's paradox where one is allowed to choose in each turn the game that a large number of individuals play. It turns out that, by choosing the game which gives the highest average earnings at each step, one ends up with systematic loses, whereas a periodic or random seque…

2002-12-16abs ↗pdf ↗

Improved speech separation and enhancement using neural beamforming.

problem Challenging speech separation and enhancement in reverberant environments.
method Sequential neural beamforming combining spectral and spatial separation methods.
result Average improvement of 2.75 dB in scale-invariant signal-to-noise ratio and 14.2% absolute reduction in speech recognition metric.

Quantifying behavior is crucial for many applications in neuroscience. Videography provides easy methods for the observation and recording of animal behavior in diverse settings, yet extracting particular aspects of a behavior for further analysis can be highly time consuming. In motor control studies, humans or other …

2018-04-09abs ↗pdf ↗

DSI measures dataset separability for neural networks.

problem Difficulty in separating different classes of data in neural networks.
method Created the Distance-based Separability Index (DSI) to quantify dataset separability.
result DSI effectively measures dataset separability and indicates similar distributions of different classes.

The Midscribability Theorem, which was first proved by O. Schramm, states that: given a strictly convex body KR3K\subset\mathbb{R}^{3} with smooth boundary and a convex polyhedron PP, there exists a polyhedron QRP3Q \subset \mathbb{RP}^3 combinatorially equivalent to PP which midscribes KK. Here the word "midscribe" me…

2014-12-15abs ↗pdf ↗

Spectral analysis shows neural networks separate from linear methods in approximating functions.

problem Separating two-layer neural networks from linear methods in function approximation.
method Spectral-based approach using Kolmogorov width and kernel spectrum.
result Upper and lower bounds on separation, explicit hard functions identified.

Boosts neural network performance by improving weight separability.

problem Improving the separability of weight vectors in neural networks.
method Proposes a new evaluation metric and feed-backward reconstruction loss to encourage weight separability.
result Improves visual recognition performance across various tasks.

Randomly initialized neural networks can linearly separate arbitrary sets.

problem Mapping two arbitrary sets to linearly separable sets.
method Randomly initialized one-layer neural networks with sufficient width.
result With high probability, these networks can transform two sets into linearly separable sets.

Constructs classifiers for neural networks with specific data configurations.

problem Finding global minima of deep ReLU neural networks on sequentially separable data.
method Explicitly constructs zero loss neural network classifiers using cumulative parameters and truncation maps.
result Global minimizers can be described with a limited number of parameters based on the data structure.

Paper improves speech separation by using deep neural networks for more accurate density priors.

problem Improving the accuracy of source priors for independent vector analysis in speech separation.
method Estimating the derivative of speech density using deep neural networks to optimize performance indices.
result Neural network density priors outperform previous ones in convergence speed and SIR.

Adversarial noises are linearly separable for random neural networks.

problem The challenge of adversarial examples in neural networks.
method Theoretical proof and empirical evidence for two-layer networks with random initialization and neural tangent kernel setup.
result Adversarial noises are linearly separable with corresponding labels.

A new unsupervised method separates speech sources without requiring labeled data.

problem Lack of supervised data for effective neural source separation.
method Uses a complex Gaussian mixture model (cGMM) for joint training of separation and localization networks.
result The method outperforms conventional initialization methods in monaural and multichannel separation.

Spatial blind source separation simplifies multivariate spatial prediction.

problem Predicting multivariate measurements at unobserved locations with spatial dependencies.
method Spatial blind source separation as a pre-processing tool compared to Cokriging and neural networks.
result Spatial blind source separation simplifies spatial prediction by avoiding cross-dependencies.

New method separates objects from images using deep neural networks trained to inpaint.

problem Fully self-supervised instance separation of occluded objects in images.
method Maximizes independence of two image regions given a fully self-supervised inpainting network.
result Method achieves similar segmentation performance to fully supervised methods on microscopy image datasets.

New findings on depth vs. width in neural networks, showing depth can improve learnability.

problem Understanding the role of depth in neural networks, especially when width is unbounded.
method Analyzing sample complexity for learnability in norm-controlled depth-2 and depth-3 ReLU networks.
result Depth can improve learnability of functions that are otherwise unlearnable with depth-2 networks.

Study shows post-COVID commodity futures returns and volatility changed for different products.

problem Analyzing how the pandemic affected Chinese commodity futures markets.
method Empirical analysis of commodity futures returns and cointegration before and after the pandemic.
result Post-COVID, some commodity futures returns increased significantly, while others saw higher volatility.

Gradient descent converges to perfect classification in neural nets for non-separable data.

problem Classifying linearly non-separable data using neural networks.
method Analysis of gradient descent dynamics in neural networks with sufficient but not large number of neurons.
result Gradient descent converges to global minima with perfect classification in the landscape of minimization problems.

A deep clustering model learns to separate audio sources without supervision.

problem Training deep clustering models requires supervision, limiting their applicability.
method Proposes an unsupervised spatial clustering approach to train a deep clustering system.
result The deep clustering model achieves similar performance to a multi-channel teacher without supervision.

Deep learning model separates syntax and semantics for better language generalization.

problem Standard deep learning methods struggle with systematic generalization in natural language.
method Implemented a Syntactic Attention model that separates syntactic and semantic processing.
result The Syntactic Attention model outperforms standard methods on a compositional generalization task.

Neural networks can learn Boolean circuits with local correlation.

problem Learning Boolean circuits with neural networks is computationally hard.
method Observing local correlation between input patterns and target labels, focusing on tree-structured Boolean circuits.
result Local correlation determines the success or failure of optimization in learning Boolean circuits.

Proves depth 2 neural networks can't approximate certain functions as well as depth 3 networks.

problem Approximating functions with depth 2 networks in high dimensions.
method Lower bound proof using worst-to-average-case random self-reducibility.
result Proves depth 2 networks can't approximate certain functions as well as depth 3 networks, resolving an open problem.

Study on size and depth of neural networks for approximating benign functions, showing barriers and explicit results.

problem Understanding how size and depth of neural networks affect their ability to approximate benign functions.
method Analyzing ReLU networks for benign functions, proving barriers and explicit results.
result Explicit benign functions that cannot be approximated by networks of certain sizes or depths, showing barriers to size and depth separation.

SepIt improves speech separation for multiple speakers.

problem Improving speech separation for multiple speakers in single channel recordings.
method SepIt uses a deep neural network that iteratively improves estimates of different speakers based on mutual information.
result SepIt outperforms state-of-the-art methods for 2, 3, 5, and 10 speakers.

The paper explores how different patterns of heterophily affect Graph Neural Networks.

problem Understanding the impact of heterophily on Graph Neural Networks.
method Theoretical analysis and experiments with Heterophilous Stochastic Block Models (HSBM).
result The impact of heterophily on classification depends on the Euclidean distance of neighborhood distributions and the averaged node degree.

New algorithm proves deep networks can learn better than shallow ones.

problem Understanding the power difference between shallow and deep neural networks.
method Identifying a class of Boolean functions and proving that logarithmic-depth networks can learn them efficiently using hierarchical reconstruction.
result First algorithmic separation between constant-depth and logarithmic-depth neural networks.