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

Trend · papers per month

265277103 · May 202619922001200920172026
48 results for traction signals

YC Bench forecasts startup success in Y Combinator batches with a short-term metric.

problem Difficult forecasting of startup success due to sparse meaningful outcomes and slow evaluation cycles.
method Developed a live benchmark using publicly available traction signals and web visibility metrics.
result Revealed 6 out of 11 top performers at YC Demo Day with a simple proxy for prior brand recognition.

Prediction markets can shape political behavior through persistent signals, not just forecast accuracy.

problem The role of prediction markets beyond forecasting.
method Transaction-level evidence from the 2024 U.S. presidential election, Signal Credibility Index (SCI).
result Price signals in prediction markets are more influential due to persistence, breadth of trader types, and cross-platform consensus.

The paper connects eigenvalue problems for various operators and establishes inequalities and asymptotic formulas for heat traces.

problem Eigenvalue problems and heat trace asymptotics for different operators.
method Establishes connections and inequalities for eigenvalues and heat traces.
result Eigenvalue inequalities and three-term asymptotic formulas for heat traces of various operators.

Solves time-optimal navigation on slippery slopes with cross gravitational wind.

problem Time-optimal navigation on a slippery cross slope under gravitational wind.
method New Finsler metric derived for the problem, considering both lateral and longitudinal gravitational effects.
result Conditions for strong convexity and purely geometric solution provided.

Articulatory distinctive features, as well as phonetic transcription, play important role in speech-related tasks: computer-assisted pronunciation training, text-to-speech conversion (TTS), studying speech production mechanisms, speech recognition for low-resourced languages. End-to-end approaches to speech-related tas…

2019-07-02abs ↗pdf ↗

Echocardiography (echo) is a common means of evaluating cardiac conditions. Due to the label scarcity, semi-supervised paradigms in automated echo analysis are getting traction. One of the most sought-after problems in echo is the segmentation of cardiac structures (e.g. chambers). Accordingly, we propose an echocardio…

2019-11-05abs ↗pdf ↗

The paper provides Gaussian approximations for decentralized Federated Learning.

problem Lack of asymptotic statistical guarantees for local SGD in Federated Learning.
method Two generalized Gaussian approximation results for local SGD trajectories.
result Valid multiplier bootstrap procedures and Gaussian bootstrap-based tests for detecting adversarial attacks.

Graph neural networks improve solving linear optimization problems.

problem Improving the efficiency of solving linear optimization problems.
method Using graph neural networks to simulate standard interior-point methods for linear optimization problems.
result Graph neural networks can solve linear optimization problems close to optimality, often outperforming conventional solvers.

The paper develops a method to discover causal relations and predict material laws with uncertainty quantification.

problem Discovering causal relations and predicting material laws with uncertainty in civil engineering applications.
method The paper develops a causal discovery algorithm to infer causal relations among time-history data. It uses a deep neural network with dropout layers for uncertainty quantification and propagates predictions through a causal graph.
result The method accurately predicts material laws and quantifies uncertainty, as demonstrated in two numerical examples.

Unified approach unites GANs and diffusion models using particle methods.

problem Combining GANs and diffusion models for generative tasks.
method Proposes a unified framework where generator training is seen as a generalization of particle models.
result Demonstrates that GANs and diffusion models can be integrated within a unified framework.

GCNs learn by embedding similar nodes within a class and leveraging consistent neighborhood structures.

problem Understanding how GCNs perform semi-supervised node classification on both homophilous and heterophilous graphs.
method Investigated the latent node embeddings and neighborhood structures of GCNs.
result GCNs learn by embedding similar nodes within a class and leveraging consistent neighborhood structures.

Unified physics-informed learning method improves generalization performance.

problem Lack of theoretical analysis for hybrid settings with incomplete physical constraints.
method Unified residual form unifying collocation and variational methods, establishing generalization performance governed by affine variety dimension.
result Generalization performance is determined by affine variety dimension, not just the number of parameters.

Improved hypernetwork for efficient neural network hyperparameter tuning.

problem Efficiently optimizing hyperparameters in neural networks.
method Proposed ΔΔ-STN architecture focusing on accurate best-response Jacobian approximation.
result Significantly improved hyperparameter tuning accuracy and stability.

With the spreading prevalence of Big Data, many advances have recently been made in this field. Frameworks such as Apache Hadoop and Apache Spark have gained a lot of traction over the past decades and have become massively popular, especially in industries. It is becoming increasingly evident that effective big data a…

2017-11-25abs ↗pdf ↗

The paper tackles scalability issues in Graph Representation Learning.

problem Prohibitive time and memory complexities in Graph Representation Learning.
method Leveraging the K-Core Decomposition property of Graphs to reduce time and memory consumption.
result Proposed techniques significantly reduce computational resources without compromising embedding quality.

This work proposes hyperbolic deep convolutional neural networks for better pattern recognition.

problem The limitations of Euclidean deep convolutional neural networks in capturing intricate patterns.
method Developed Hyperbolic DCNN based on Poincaré Disc, analyzing expansive convolution in non-Euclidean space.
result Hyperbolic convolutional architecture outperforms Euclidean ones in pattern recognition tasks.

Hybrid quantum-classical RL model solves standard benchmark tasks and proves quantum advantage.

problem Challenges in reinforcement learning, especially in solving standard benchmarking tasks.
method Parametrized quantum circuits in a hybrid quantum-classical RL model.
result Demonstrates quantum advantage in solving standard benchmarking tasks and intractable classical problems.

A new geometry for comparing signals, overcoming traditional limitations.

problem Comparing and interpolating discontinuous and signed signals.
method Investigation of Riemannian geometry on signal space, introducing a metric that measures both horizontal and vertical deformations.
result Characterization of metric properties and establishment of geodesic regularity and stability.

This paper analyzes arbitrage opportunities in Polymarket's NBA markets.

problem Underexplored market microstructure and high-frequency pricing efficiency in decentralized prediction markets.
method Systematic empirical analysis of algorithmic arbitrage using over 75 million limit order book snapshots.
result Microstructural efficiency is profound, with single-market anomalies rare and combinatorial inefficiencies more frequent.

Neuro-Evolution is a field of study that has recently gained significantly increased traction in the deep learning community. It combines deep neural networks and evolutionary algorithms to improve and/or automate the construction of neural networks. Recent Neuro-Evolution approaches have shown promising results, rival…

2019-01-02abs ↗pdf ↗

Paper presents a unique method to recover signals from their bispectrum.

problem Retrieving signals accurately from their bispectrum.
method Two-step trust region algorithm that minimizes a non-convex objective function.
result Signals with finite spectral or temporal support can be recovered from at least 3B measurements of their bispectrum.

Paper proposes efficient methods for clustering and signal recovery in high-dimensional data with block structures.

problem High-dimensional clustering and signal recovery under block signal structures.
method CFA-PCA and MA-PCA methods for sparse and dense block signals.
result Proposed methods achieve computational minimax optimality for clustering and signal recovery.

Unified framework for multi-view autoencoders simplifies model implementation and evaluation.

problem Inconsistent notation and implementation of multi-view autoencoders.
method Unified mathematical framework, documentation, and Python library.
result Comparable or superior performance in benchmarking experiments.

Solves time-minimizing navigation on a mountain slope using Riemann-Finsler geometry.

problem Time-minimizing navigation on a mountain slope under gravity.
method Riemann-Finsler geometry, Zermelo navigation problem, anisotropic deformation of the background Riemannian metric, rescaled gravitational wind.
result A new Finsler metric for optimal navigation on slippery mountain slopes.

Improved exploration in RL with latent state marginalization.

problem Complexity of deep probabilistic models limits their practical use in reinforcement learning.
method Adopting latent variable policies within the MaxEnt framework, with low-cost marginalization of latent states.
result Effective marginalization leads to better exploration and more robust training.

New framework models graph signals as distribution-valued signals in Wasserstein space.

problem Limitations of classical vector-based GSP, including synchronous observations and uncertainty.
method Introduces graph distribution-valued signals (GDSs) in the Wasserstein space.
result GDSs naturally encode uncertainty and stochasticity, generalizing traditional graph signals.

The paper explores how to measure and optimize ad reach while maintaining user privacy.

problem Measuring ad reach while preserving user privacy in online advertising.
method Introduces kk-anonymity and probabilistic discounting for frequency capping.
result Privacy introduces a significant performance drop but with manageable costs.

New algorithms improve signal processing in federated learning.

problem Efficiently process distributed signal samples with privacy and communication constraints.
method Proposes overpredictive signal approximations using convex optimization.
result Quantifies tradeoffs between communication cost, sampling rate, and approximation error.