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

Trend · papers per month

63126188251 · May 202619922001200920172026
48 results for aspiration level hypothesis

This paper optimizes predicting support and resistance levels in financial markets.

problem Optimizing prediction of resistance and support levels in financial markets.
method Assuming a constant elasticity of variance process, the paper derives optimal trading boundaries using the aspiration level hypothesis.
result Optimal trading boundaries serve as predictors of resistance and support levels, located relative to the median interval of the hidden aspiration level.

Hypothesis testing is an important problem with applications in target localization, clinical trials etc. Many active hypothesis testing strategies operate in two phases: an exploration phase and a verification phase. In the exploration phase, selection of experiments is such that a moderate level of confidence on the …

2018-12-04abs ↗pdf ↗

ASPIRE improves amortized posterior inference for Bayesian inverse problems.

problem Bayesian inverse problems are computationally challenging due to uncertainty quantification.
method Iterative refinement of amortized posteriors using physics-based and summary statistics.
result ASPIRE achieves better posterior approximations with minimal extra computations.

NeurT-FDR controls FDR by incorporating auxiliary covariates in deep learning.

problem Controlling FDR in complex large-scale problems with indirect relations among covariates.
method NeurT-FDR uses a deep Black-Box framework that parametrizes test-level covariates as a neural network and adjusts auxiliary covariates through a regression framework.
result NeurT-FDR makes substantially more discoveries in real datasets compared to competitive baselines.

NeurT-FDR controls FDR by incorporating feature hierarchy.

problem Controlling FDR in complex, large-scale hypothesis testing problems.
method NeurT-FDR uses a neural network to parametrize test-level covariates and a regression framework to adjust feature hierarchy.
result NeurT-FDR makes substantially more discoveries than competitive baselines.

Knowing and modelling the migration phenomena and especially the social and economic consequences have a theoretical and practical importance, being related to their consequences for development, economic progress (or as appropriate, regression), environmental influences etc. One of the causes of migration, especially …

2012-02-05abs ↗pdf ↗

This research explores inductive biases for deep learning to improve AI's higher-level cognition.

problem Current AI struggles with flexible out-of-distribution and systematic generalization.
method Examines and proposes new inductive biases for deep learning.
result Identifies specific inductive biases for higher-level sequential processing.

This article presents a theoretical model for a dynamic system based on sustainable development. Due to the relatively absence of theoretical studies and practical issues in the area of sustainable development, Romania aspires to the principles of sustainable development. Based on the concept as a process in which econ…

2011-02-28abs ↗pdf ↗

The paper introduces the spirality character of the almost fiber part for a closed essentially immersed subsurface of a closed orientable aspherical 3-manifold, which generalizes an invariant due to Rubinstein and Wang. The subsurface is virtually embedded if and only if the almost fiber part is aspiral, and in this ca…

2014-06-18abs ↗pdf ↗

New bounds on generalization error using information density moments.

problem Bounding the generalization error of randomized learning algorithms.
method Derives bounds on average and tail probabilities of generalization error using mth central moments of the information density.
result Explicit bounds on generalization error are derived, showing better dependence on confidence level with higher-order information density moments.

Machine learning (ML) has become a commodity in our every-day lives. We routinely ask ML empowered smartphones to suggest lovely food places or to guide us through a strange place. ML methods have also become standard tools in many fields of science and engineering. A plethora of ML applications transform human lives a…

2018-05-14abs ↗pdf ↗

SAEs struggle with feature consistency across runs, hindering MI reliability.

problem Inconsistency of learned SAE features across different training runs.
method Propose using the Pairwise Dictionary Mean Correlation Coefficient (PW-MCC) to measure feature consistency.
result High levels of feature consistency (0.80 for TopK SAEs on LLM activations) are achievable with appropriate architectural choices.

Hypothesis testing plays a central role in statistical inference, and is used in many settings where privacy concerns are paramount. This work answers a basic question about privately testing simple hypotheses: given two distributions PP and QQ, and a privacy level ε\varepsilon, how many i.i.d. samples are needed to…

2018-11-27abs ↗pdf ↗

Multiple hypothesis testing, a situation when we wish to consider many hypotheses, is a core problem in statistical inference that arises in almost every scientific field. In this setting, controlling the false discovery rate (FDR), which is the expected proportion of type I error, is an important challenge for making …

2019-02-07abs ↗pdf ↗

Proposes a new model for testing causal structural priors and synthesizing data.

problem Testing and synthesizing causal structural priors using nonparametric knowledge and neural networks.
method Causal Structural Hypothesis Testing (C-SHT) and Causal Structural Variational Hypothesis Testing (C-SVHT) using deep neural networks.
result Demonstrates out-of-distribution generalization error as a proxy for causal structural prior hypothesis testing.

This work examines the effects of allowing borrowing in betting-based hypothesis testing.

problem The impact of allowing borrowing in betting-based hypothesis testing.
method Examined the consequences of allowing borrowing in each round, adjusting the rejection threshold accordingly.
result There is no extra price to pay for the possibility of borrowing if a path-dependent threshold is used.

The paper analyzes a neural network two-sample test using kernel analysis.

problem Determining if two datasets come from the same distribution.
method Time-analysis on a neural tangent kernel (NTK) two-sample test, extending to realistic neural network dynamics.
result Training times needed to detect deviations are well-separated in null and alternative hypothesis scenarios.

LOO prediction method improves generalization guarantees for arbitrary datasets.

problem Understanding LOO error guarantees in fully transductive settings for arbitrary datasets.
method Median of Level-Set Aggregation (MLSA) for empirical-risk level sets.
result Multiplicative oracle inequality for LOO error with complexity scaling.

Paper extends Chernoff sampling for active testing and parameter estimation, improving neural network and regression models.

problem Reducing sample complexity in hypothesis testing and model parameter estimation.
method Developed an extension of Chernoff sampling for active learning and parameter estimation.
result Non-asymptotic bounds for sample complexity and estimation error in active learning.

We present a general framework for hypothesis testing on distributions of sets of individual examples. Sets may represent many common data sources such as groups of observations in time series, collections of words in text or a batch of images of a given phenomenon. This observation pattern, however, differs from the c…

2019-07-09abs ↗pdf ↗

Deep Reinforcement Learning (DRL) has shown impressive performance on domains with visual inputs, in particular various games. However, the agent is usually trained on a fixed environment, e.g. a fixed number of levels. A growing mass of evidence suggests that these trained models fail to generalize to even slight vari…

2020-01-27abs ↗pdf ↗

Binary testing for softmax models requires many samples, similar to leverage score models.

problem Binary hypothesis testing for softmax models and leverage score models.
method Analyzing sample complexity and drawing analogies between models.
result Sample complexity is asymptotically \(O(ε^{-2})\), where \(ε\) is the distance between model parameters.

EviTrack improves sequential prediction in delayed disambiguation scenarios.

problem Challenges in sequential prediction with delayed disambiguation where early observations are ambiguous.
method EviTrack operates over latent trajectories, applying evidence- and likelihood-ratio-based selection to delay commitment until supported by data.
result EviTrack outperforms sampling-based baselines in a controlled synthetic benchmark, achieving faster post-disambiguation recovery.

Investigates sequential problems on graph structures and large action spaces.

problem Sequential decision-making on graph structures and large action spaces.
method Spectral bandits, side observations, influence maximization, kernel bandits, polymatroid bandits, function optimization, infinitely many-arms bandits.
result Contributions to graph and structured bandits.

Structural equation models and Bayesian networks have been widely used to study causal relationships between continuous variables. Recently, a non-Gaussian method called LiNGAM was proposed to discover such causal models and has been extended in various directions. An important problem with LiNGAM is that the results a…

2009-09-16abs ↗pdf ↗

We discuss martingales, detrending data, and the efficient market hypothesis for stochastic processes x(t) with arbitrary diffusion coefficients D(x,t). Beginning with x-independent drift coefficients R(t) we show that Martingale stochastic processes generate uncorrelated, generally nonstationary increments. Generally,…

2007-01-23abs ↗pdf ↗

In many practical applications of multiple hypothesis testing using the False Discovery Rate (FDR), the given hypotheses can be naturally partitioned into groups, and one may not only want to control the number of false discoveries (wrongly rejected null hypotheses), but also the number of falsely discovered groups of …

2015-12-10abs ↗pdf ↗

Study tests financial market efficiency using random number generator tests.

problem Check for informational efficiencies in financial markets.
method Analysed binary daily returns as random number generators, split analysis by annual and company levels, investigated longer-term efficiency over Nasdaq-listed companies.
result Information efficiency varies across years and reflects large-scale market impacts.

Researchers have developed neural network verification algorithms motivated by the need to characterize the robustness of deep neural networks. The verifiers aspire to answer whether a neural network guarantees certain properties with respect to all inputs in a space. However, many verifiers inaccurately model floating…

2020-03-06abs ↗pdf ↗

Automated hyperparameter tuning aspires to facilitate the application of machine learning for non-experts. In the literature, different optimization approaches are applied for that purpose. This paper investigates the performance of Differential Evolution for tuning hyperparameters of supervised learning algorithms for…

2019-04-15abs ↗pdf ↗

The quantitative aspirations of economists and financial analysts have for many years been based on the belief that it should be possible to build models of economic systems - and financial markets in particular - that are as predictive as those in physics. While this perspective has led to a number of important breakt…

2010-03-13abs ↗pdf ↗