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

Trend · papers per month

145290435580 · Jun 202019922001200920172026
48 results for unbounded search space

LLA shows strong performance in Bayesian optimization but has unbounded search space issues.

problem Applying LLA in unbounded search spaces for Bayesian optimization.
method Linearized-Laplace approximation applied to Bayesian optimization problems.
result LLA demonstrates strong performance but also presents unbounded search space challenges.

AlphaCFG discovers alpha factors using grammar-guided search.

problem Discovering formulaic alpha factors in finance.
method AlphaCFG uses a grammar-based framework to define and discover alpha factors with syntactic and semantic constraints.
result AlphaCFG outperforms state-of-the-art methods in trading profitability and efficiency.

Constructs unbounded Kasparov product for sphere embeddings into Euclidean space.

problem Embedding spheres into Euclidean space and their associated Kasparov cycles.
method Constructs unbounded Kasparov cycles, equips with connections, computes unbounded Kasparov product with Dirac operator, identifies index cycles.
result Spectral triple for algebra C(Sn)C(\mathbb S^n) differs from round sphere Dirac operator by index cycle.

New PAC-Bayes training method improves model generalization for unbounded loss.

problem Improving generalization of complex models under unbounded loss.
method Established new PAC-Bayes bound for unbounded loss, jointly training prior and posterior.
result Outperforms existing PAC-Bayes training algorithms and matches ERM accuracy.

Bayesian optimization has recently emerged as a popular and efficient tool for global optimization and hyperparameter tuning. Currently, the established Bayesian optimization practice requires a user-defined bounding box which is assumed to contain the optimizer. However, when little is known about the probed objective…

2015-08-14abs ↗pdf ↗

Study ancient solutions on graphs with unbounded Laplacians, generalizing previous results.

problem Understanding ancient solutions on graphs with unbounded Laplacians.
method Generalizing Colding and Minicozzi's theorem and Hua's result to graphs with unbounded Laplacians.
result The dimension of the space of ancient solutions of polynomial growth is bounded by the dimension of harmonic functions with the same growth.

Symplectic method solves infinite-dimensional Schrödinger equations.

problem Solving Schrödinger equations on infinite-dimensional Hilbert spaces with unbounded Hamiltonians.
method Analytic vectors, manifolds modelled on normed spaces, symplectic differential geometry, Marsden--Weinstein reduction.
result Mapped tt-dependent Schrödinger equations onto projective spaces.

New algorithm tackles multiclass transductive online learning with unbounded labels.

problem Characterizing optimal mistake bound for unbounded label spaces.
method Introducing new combinatorial dimensions (Level-constrained Littlestone and Branching dimensions) to characterize online learnability.
result Established trichotomy of possible minimax rates for unbounded label spaces: Θ(T)Θ(T), Θ(logT)Θ(\log T), or Θ(1)Θ(1).

New neural network rates for unbounded domains with weighted Sobolev spaces.

problem Improving neural network approximation rates for unbounded domains.
method Embedding results for weighted Fourier-Lebesgue spaces in weighted Sobolev spaces, followed by asymptotic approximation rates.
result Asymptotic approximation rates for shallow neural networks without curse of dimensionality for unbounded domains and Muckenhoupt weights.

New approach finds solutions to games with unbounded controls.

problem Existence of equilibrium in mean-field games with unbounded controls.
method Weak formulation and new existence/stability results for quadratic-growth generalized McKean-Vlasov BSDEs.
result Existence of equilibrium result for non-Markovian mean-field games with unbounded control space.

In this work, we study a new approach to optimizing the margin distribution realized by binary classifiers. The classical approach to this problem is simply maximization of the expected margin, while more recent proposals consider simultaneous variance control and proxy objectives based on robust location estimates, in…

2018-10-11abs ↗pdf ↗

New approach to concentration inequalities for unbounded state space dynamical systems.

problem Concentration inequalities for unbounded state space dynamical systems.
method Functional analytic framework, transport-entropy inequality.
result Exponential concentration inequalities for sampling from stationary distribution.

A new language for neural architecture search decouples search spaces and algorithms.

problem Current neural architecture search methods are limited to specific use-cases and lack general-purpose constructs.
method Proposes a formal language for encoding search spaces over general computational graphs, allowing modular, composable, and reusable encodings.
result The language enables easy experimentation with different search spaces and algorithms without reinventing the wheel.

New analysis shows a gap between Gaussian RKHS and neural networks on unbounded domains.

problem Understanding the function space bias of neural networks compared to Gaussian RKHS.
method Infinite-center asymptotic analysis of neural network Banach space and Gaussian RKHS on unbounded domains.
result Certain functions in Gaussian RKHS have infinite norm in neural network Banach space on unbounded domains.

Solves open problem on universally consistent online learning with unbounded losses.

problem Open problem on universally consistent online learning with unbounded losses.
method Constructs random measurable partitions of the instance space.
result Simple memorization rule is optimistically universal for any unbounded loss.

A new framework generates large hierarchical search spaces for neural architectures.

problem Discovering neural architectures from simple blocks is hard.
method Context-free grammars for a unified, scalable search space.
result Efficiently searches over complete architectures, outperforming existing methods.

Using results from our companion article [arXiv:1112.4824v2] on a Schauder approach to existence of solutions to a degenerate-parabolic partial differential equation, we solve three intertwined problems, motivated by probability theory and mathematical finance, concerning degenerate diffusion processes. We show that th…

2012-11-20abs ↗pdf ↗

We factorize the Dirac operator on the Connes-Landi 4-sphere in unbounded KK-theory. We show that a family of Dirac operators along the orbits of the torus action defines an unbounded Kasparov module, while the Dirac operator on the principal orbit space -an open quadrant in the 2-sphere- defines a half-closed chain. W…

2018-03-23abs ↗pdf ↗

Two new algorithms improve performance in adversarial bandits with unbounded losses.

problem Adversarial Multi-Armed Bandits with unbounded losses.
method Developed UMAB-NN and UMAB-G for non-negative and general unbounded losses respectively.
result UMAB-NN achieves the first adaptive and scale-free regret bound for non-negative unbounded losses.

Statistical model checking for PCTL on MDPs using reinforcement learning.

problem Model checking PCTL specifications on MDPs with statistical methods.
method Reinforcement learning for policy search, statistical model checking with UCB-based Q-learning.
result Provably guaranteed statistical model checking method for PCTL specifications on MDPs.

We produce solutions to the Kähler-Ricci flow emerging from complete initial metrics g0g_0 which are C0C^0 Hermitian limits of Kähler metrics. Of particular interest is when g0g_0 is Kähler with unbounded curvature. We provide such solutions for a wide class of U(n)U(n)-invariant Kähler metrics g0g_0 on nn dimensional c…

2014-02-26abs ↗pdf ↗

GP-PSRL achieves sublinear regret for continuous control with unbounded state space.

problem Analyzing regret bounds for GP-PSRL in continuous control with unbounded state space.
method Recursive application of Borell-Tsirelson-Ibragimov-Sudakov inequality and chaining method.
result Sublinear regret bound of O~(HγTT)\widetilde{\mathcal{O}}(H\sqrt{γ_TT}) for GP-PSRL.

A real valued function φ\varphi of one variable is called a metric transform if for every metric space (X,d)(X,d) the composition dφ=φdd_\varphi = \varphi\circ d is also a metric on XX. We give a complete characterization of the class of approximately nondecreasing, unbounded metric transforms φ\varphi such that the trans…

2017-10-13abs ↗pdf ↗

Algorithm learns diffusion processes with high-dimensional state spaces.

problem Stochastic control of unbounded diffusion processes with high-dimensional state spaces.
method Adaptive partitioning and learning algorithm that refines discretization based on estimation bias and statistical confidence.
result Established regret bounds that depend on problem parameters, extending to unbounded diffusion processes.

We consider the notion of dimension in four categories: the category of (unbounded) separable metric spaces and (metrically proper) Lipschitz maps, and the category of (unbounded) separable metric spaces and (metrically proper) uniform maps. A unified treatment is given to the large scale dimension and the small scale …

2006-07-10abs ↗pdf ↗

einspace expands NAS search space to include diverse neural architectures.

problem NAS results are often limited to existing structures; new designs are rare.
method einspace uses a probabilistic context-free grammar to create a versatile search space.
result einspace discovers novel and improved architectures, including convolutions and attention.

Approaches to learning Bayesian networks from data typically combine a scoring function with a heuristic search procedure. Given a Bayesian network structure, many of the scoring functions derived in the literature return a score for the entire equivalence class to which the structure belongs. When using such a scoring…

2013-02-13abs ↗pdf ↗

We establish the factorization of Dirac operators on Riemannian submersions of compact spinc^c manifolds in unbounded KK-theory. More precisely, we show that the Dirac operator on the total space of such a submersion is unitarily equivalent to the tensor sum of a family of Dirac operators with the Dirac operator on th…

2016-10-10abs ↗pdf ↗

Develops thermodynamic formalism for quasimorphisms on negatively curved spaces.

problem Analyzing quasimorphisms on negatively curved spaces.
method Thermodynamic formalism framework, Banach isomorphism, weak Livšic cohomology.
result Establishes Central Limit Theorem and invariance principle for unbounded quasimorphisms.

New model reduces matrix factorization bias, yielding truly low-rank solutions.

problem Gradient descent's implicit bias in matrix factorization.
method Introducing a new factorization model with constrained factors and diagonal components.
result The new model consistently exhibits a strong implicit bias, yielding truly low-rank solutions.

We introduce the quasi-hyperbolicity constant of a metric space, a rough isometry invariant that measures how a metric space deviates from being Gromov hyperbolic. This number, for unbounded spaces, lies in the closed interval [1,2][1,2]. The quasi-hyperbolicity constant of an unbounded Gromov hyperbolic space is equal to…

2019-08-12abs ↗pdf ↗