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

Trend · papers per month

14284155 · May 202619922001200920172026
48 results for technical hypotheses

The paper defines and proves the existence of train track maps on graphs of groups.

problem Understanding homotopy equivalences in graphs of groups.
method Developed the theory of train track maps on graphs of groups, defining maps and homotopy equivalences.
result Any homotopy equivalence of a graph of groups may be represented by a relative train track map under certain conditions.

Investment strategies in financial markets can lead to instability due to market impacts.

problem Market impacts make it impossible for investors to accurately optimize their strategies.
method Built an agent-based model with technical analysis strategy agents to investigate optimization instability.
result Investment strategies' parameters never converged but continued to change, leading to unstable market price evolution.

We use Morse theory to prove that the Lefschetz Hyperplane Theorem holds for compact smooth Deligne-Mumford stacks over the site of complex manifolds. For ZXZ \subset X a hyperplane section, XX can be obtained from ZZ by a sequence of deformation retracts and attachments of high-dimensional finite disc quotients. We …

2010-08-04abs ↗pdf ↗

Partial connections are (singular) differential systems generalizing classical connections on principal bundles, yielding analogous decompositions for manifolds with nonfree group actions. Connection forms are interpreted as maps determining projections of the tangent bundle onto the partial connection; this approach e…

2003-09-14abs ↗pdf ↗

We give a complete answer to the question of when two curves in two different Riemannian manifolds can be seen as trajectories of rolling one manifold on the other without twisting or slipping. We show that up to technical hypotheses, a rolling along these curves exists if and only if the geodesic curvatures of each cu…

2011-11-03abs ↗pdf ↗

We study a policy gradient method with L2 regularization for MAB problems.

problem Improving policy gradient methods for MAB problems with regularization.
method Investigate convergence of a policy gradient algorithm with L2 regularization for MAB.
result Prove convergence under appropriate technical hypotheses and show practical improvements.

Paper develops a consistent model selection framework for learning Hypotheses Space from data.

problem Avoiding overfitting in complex spaces with limited data.
method Develops a model selection framework based on Learning Spaces, selecting a Hypotheses Space from data.
result The method converges with probability one to a target Hypotheses Space, providing a consistent framework for model selection.

Learning rates for least-squares regression are typically expressed in terms of L2L_2-norms. In this paper we extend these rates to norms stronger than the L2L_2-norm without requiring the regression function to be contained in the hypothesis space. In the special case of Sobolev reproducing kernel Hilbert spaces used …

2017-02-23abs ↗pdf ↗

We prove a global local rigidity result for character varieties of 3-manifolds into SL2\rm{SL}_2. Given a 3-manifold with toric boundary MM satisfying some technical hypotheses, we prove that all but a finite number of its Dehn fillings Mp/qM_{p/q} are globally locally rigid in the following sense: every irreducible repr…

2014-06-11abs ↗pdf ↗

Paper tackles efficient learning of non-convex hypotheses in metric spaces.

problem Efficiently find consistent hypotheses for non-convex hypotheses composed of possibly several disconnected regions.
method Proposes a general domain-independent algorithm for finding consistent weakly convex hypotheses and proves sufficient conditions for its efficiency.
result Shows that consistent hypothesis finding problem can be solved in polynomial time for a broad class of weakly convex hypotheses over metric spaces.

Boosting combines weak hypotheses to create accurate predictions under bounded VC dimension.

problem How to combine weak hypotheses to achieve accurate predictions efficiently.
method Designing a novel boosting algorithm with complex aggregation rules for bounded VC dimension classes.
result The new boosting algorithm requires fewer weak hypotheses than classical lower bounds, provided they belong to a bounded VC class.

DivDis learns diverse hypotheses from underspecified data to improve robustness.

problem Learning from underspecified datasets leads to multiple equally viable solutions, causing out-of-distribution issues.
method DivDis framework: 1) learns diverse hypotheses using unlabeled test data, 2) selects one hypothesis with minimal additional supervision.
result DivDis finds robust features in image and natural language processing problems.

ChemCPA predicts cellular responses to novel drugs using transfer learning.

problem Scaling high-throughput screens to measure cellular responses for many drugs is costly and challenging.
method ChemCPA, a new encoder-decoder architecture combined with transfer learning.
result Training on existing bulk RNA HTS datasets improves generalization performance, reducing the need for extensive single-cell screens.

Machine Learning benefits from prior information and computational power for better performance and understanding.

problem Improper use of Machine Learning methods leads to lack of understanding and performance issues.
method Employing prior information and computational power to solve learning problems, emphasizing interpretability and performance.
result Combining prior information and computational power can lead to better understanding and performance in Machine Learning.

New method uses LLMs to generate detailed scientific hypotheses.

problem Generating detailed, actionable scientific hypotheses from coarse initial directions.
method Hierarchical search method that incrementally adds details to hypotheses.
result Hierarchical search method consistently outperforms strong baselines on expert-annotated hypotheses.

Sequential tests for nonparametric hypotheses using supermartingales.

problem Designing valid sequential tests for nonparametric null hypotheses.
method Using elicitable and identifiable functionals, nonnegative supermartingales, and Online Convex Optimization.
result Rigorous guarantees on asymptotic power for a wide range of alternative hypotheses.

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 ↗

Hypothesis testing in singular models is fundamentally about identifiable vs. non-identifiable parameters.

problem Testing in singular models is inherently problematic due to non-identifiability and degeneracy of Fisher information.
method Formalized the overlap obstruction and showed that hypotheses over non-identifiable parameters are untestable, while those over identifiable parameters reduce to classical testing.
result Hypotheses over non-identifiable parameters are untestable, while those over identifiable parameters reduce to classical testing.

s-RBFN integrates multiple hypotheses for efficient and diverse prediction.

problem Integrating multiple hypotheses into learning models for regression.
method Structured Radial Basis Function Network (s-RBFN) using Voronoi tessellations and least-squares training.
result s-RBFN achieves superior generalization and efficiency compared to other models.

Near-optimal private tests for simple and MLR hypotheses developed under Gaussian differential privacy.

problem Developing private tests for simple and MLR hypotheses under Gaussian differential privacy.
method A private mean estimator with data-driven clamping bounds, constructing private test statistics.
result Private tests achieve the same asymptotic relative efficiency as non-private most powerful tests.

The paper limits the profitability of technical trading rules and finds they are not better than random trading.

problem The profitability of technical trading rules in stock markets is controversial.
method Proves the upper bound of cumulative return and investigates the profitability of technical trading rules using bootstrap methodology.
result Technical trading rules are not better than random trading and less profitable than the market.

Confirmation bias leads to biased estimates in noisy data analysis.

problem Confirmation bias affects scientific conclusions in noisy data environments.
method Investigation of confirmation bias in Gaussian mixture models using K-means and EM algorithms.
result Estimates from algorithms are biased and resemble initial hypotheses, not the noise.

The paper proves weaker conditions for global smoothings of special Lagrangian submanifolds with conical singularities.

problem Conditions for global smoothings of special Lagrangian submanifolds with isolated conical singularities.
method Proof of weaker conditions for global smoothings.
result Global smoothings are possible under weaker hypotheses than previously known.

Active inference selects actions to maximize information gain, aiding structure learning.

problem Learning the structure of underlying world models.
method Active inference selects actions based on expected free energy, which includes information gain and value.
result Actions that maximize information gain help disambiguate among alternative models.

The paper studies Liouville structures for taut foliations and Anosov flows, proving their topological invariance.

problem Understanding the topological invariance of Liouville structures for taut foliations and Anosov flows.
method Combining smoothing schemes for topological conjugacies and a refinement of Vogel's uniqueness result.
result Liouville structures are topological invariants of taut foliations and orbit equivalent Anosov flows.

Study identifies and analyzes spurious correlations in data-driven models.

problem Spurious correlations in data-driven models are unreliable and hard to detect.
method Collect and analyze synthetic datasets generated from causal graphs to investigate spurious correlations.
result Patterns connecting spurious correlation hypotheses and model design choices were observed.

Boosting algorithms produce a classifier by iteratively combining base hypotheses. It has been observed experimentally that the generalization error keeps improving even after achieving zero training error. One popular explanation attributes this to improvements in margins. A common goal in a long line of research, is …

2019-01-30abs ↗pdf ↗

Abstract: A new approach to technical indicators without lag.

problem Defining classical technical indicators as bounded operators for lag-free trading.
method Using linear algebra to redefine technical indicators as bounded operators in l(N)l^\infty(\mathbb{N}) space.
result Demonstrated the no-lag versions of technical indicators are simpler and more effective.

We consider a distributed learning setup where a network of agents sequentially access realizations of a set of random variables with unknown distributions. The network objective is to find a parametrized distribution that best describes their joint observations in the sense of the Kullback-Leibler divergence. Apart fr…

2016-05-06abs ↗pdf ↗

Crowdsourcing has been successfully applied in many domains including astronomy, cryptography and biology. In order to test its potential for useful application in a Smart Grid context, this paper investigates the extent to which a crowd can contribute predictive hypotheses to a model of residential electric energy con…

2017-09-08abs ↗pdf ↗

The paper studies cohomology of groups acting on 1-manifolds and applies results to spectrum problems.

problem Understanding cohomology of groups acting on 1-manifolds and its applications to spectrum problems.
method Proves a criterion for vanishing second bounded cohomology and applies it to various groups and spectrum problems.
result Provides new computations of second bounded cohomology and solves several spectrum problems.