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

Trend · papers per month

2356 · Jun 202619922001200920172026
48 results for Latin Hypercube

We consider the problem of estimating E[f(U1,,Ud)]\mathbb{E} [f(U^1, \ldots, U^d)], where (U1,,Ud)(U^1, \ldots, U^d) denotes a random vector with uniformly distributed marginals. In general, Latin hypercube sampling (LHS) is a powerful tool for solving this kind of high-dimensional numerical integration problem. In the case of depende…

2013-11-19abs ↗pdf ↗

A new sampling strategy improves reliability and robustness optimization for complex designs.

problem High sample requirements for optimizing reliability and robustness in complex designs.
method Local Latin Hypercube Refinement (LoLHR) for multi-objective design uncertainty optimization.
result LoLHR achieves better results compared to other surrogate-based strategies.

Sampling strategies significantly affect feature approximations in ELA, impacting classifier accuracy.

problem The impact of sampling strategies on feature approximations in ELA.
method Analysis of feature approximations from different sampling strategies and sample sizes.
result Feature approximations from different sampling strategies do not converge, affecting classifier accuracy.

ISOMORPH creates a digital twin for supply chain logistics, advancing time-series forecasting benchmarks.

problem Lack of public benchmarks for supply chain logistics time-series forecasting.
method Developed a digital twin simulator with interpretable parameters and modular topology, generating datasets and verifying conservation laws.
result Foundation models achieve MASE values exceeding public benchmarks at low-to-moderate horizons, supporting UQ.

Physical systems are modelled and investigated within simulation software in an increasing range of applications. In reality an investigation of the system is often performed by empirical test scenarios which are related to typical situations. Our aim is to derive a method which generates diverse test scenarios each re…

2018-10-04abs ↗pdf ↗

ALAMO is a computational methodology for leaning algebraic functions from data. Given a data set, the approach begins by building a low-complexity, linear model composed of explicit non-linear transformations of the independent variables. Linear combinations of these non-linear transformations allow a linear model to b…

2017-05-31abs ↗pdf ↗

A co-evolutionary approach for Heston model calibration reduces overfitting with diverse datasets.

problem Overfitting and lack of generalization in Heston model calibration.
method Coupling a genetic algorithm with an evolving neural inverse map, using both GA-history sampling and Latin hypercube sampling.
result Diverse datasets improve out-of-sample stability and calibration accuracy.

A tailored HTR system improves CER to 0.015 for medieval Latin.

problem Digitizing handwritten medieval Latin records for a low-resource language.
method End-to-end pipeline using image segmentation and transformer-based models with extensive data augmentation.
result Best-performing setup achieved CER of 0.015, superior to commercial models.

Paper develops an efficient approach to reduce HPO time.

problem Challenges in determining optimal hyperparameters due to large number and training time.
method Nested Latin hypercube design for initialization, truncated additive Gaussian process model for calibration, sequential model-based algorithm for optimization.
result Demonstrates competitive performance on various machine learning models.

This paper develops efficient surrogate models for optimization of complex dynamical systems.

problem Computational expense in solving complex dynamical systems through numerical simulation.
method Combination of proper orthogonal decomposition and radial basis functions for constructing low-dimensional surrogate models.
result Surrogate models reduce computational time for optimization problems while maintaining accuracy.

Space-filling designs such as scrambled-Hammersley, Latin Hypercube Sampling and Jittered Sampling have been proposed for fully parallel hyperparameter search, and were shown to be more effective than random or grid search. In this paper, we show that these designs only improve over random search by a constant factor. …

2019-10-18abs ↗pdf ↗

The hypercube's perimeter is significantly larger than expected near half volume.

problem Understanding the isoperimetric profile of the hypercube.
method Analytical proof of perimeter bounds and comparison to Gaussian isoperimetric profile.
result The isoperimetric profile of the hypercube does not converge to the Gaussian profile as dimension increases.

In this paper we introduce a representation of a embedded knotted (sometimes Lagrangian) tori in $\BR^4$ called a hypercube diagram, i.e., a 4-dimensional cube diagram. We prove the existence of hypercube homology that is invariant under 4-dimensional cube diagram moves, a homology that is based on knot Floer homology.…

2010-10-18abs ↗pdf ↗

Defined by Joyce and Matveev, the fundamental quandle is a complete invariant of oriented classical knots. We consider invariants of knots defined from quotients of the fundamental quandle. In particular, we introduce the fundamental Latin Alexander quandle of a knot and consider its Gröbner basis-valued invariants, wh…

2014-04-24abs ↗pdf ↗

Study applies HRP to Latin American markets, showing smoother risk-return profile.

problem Lack of empirical analyses of HRP in Latin American markets.
method Hierarchical Risk Parity (HRP) with hierarchical clustering and recursive bisection.
result HRP portfolio outperforms Max Sharpe portfolio in NUAM markets, with smoother risk-return profile.

This paper investigates the use of multiple directions of stratification as a variance reduction technique for Monte Carlo simulations of path-dependent options driven by Gaussian vectors. The precision of the method depends on the choice of the directions of stratification and the allocation rule within each strata. S…

2010-04-28abs ↗pdf ↗

Paper improves variational inference on Boolean hypercube using quantum methods.

problem Improving variational inference for pairwise Markov random fields on the Boolean hypercube.
method Quantum relaxations of the Kullback-Leibler divergence for upper-bounds, primal-dual optimization, and greedy selection of hierarchies.
result Efficient algorithm and improved bounds for variational inference.

The study shows how discrete graphs can resemble hypercube structures under certain curvature conditions.

problem Understanding the structure of graphs with specific curvature conditions.
method Analyzing weighted graphs with lower Ricci curvature bounds and eigenvalue closeness to establish structural similarity.
result Discrete graphs with specific curvature conditions are close to hypercube structures in terms of Frobenius distance and eigenfunctions.

A quandle is a self-distributive algebraic structure that appears in quasi-group and knot theories. For each abelian group A and c \in A we define a quandle G(A, c) on \Z_3 \times A. These quandles are generalizations of a class of non-medial Latin quandles defined by V. M. Galkin so we call them Galkin quandles. Each …

2011-07-28abs ↗pdf ↗

We study a general online linear optimization problem(OLO). At each round, a subset of objects from a fixed universe of nn objects is chosen, and a linear cost associated with the chosen subset is incurred. To measure the performance of our algorithms, we use the notion of regret which is the difference between the to…

2018-06-12abs ↗pdf ↗

New algorithm learns halfspaces over hypercube with random bit flips.

problem Agnostic learning of Boolean halfspaces over discrete domains is computationally hard.
method Smoothed analysis with random bit flips for discrete inputs.
result First efficient algorithm for smoothed agnostic learning of halfspaces over Boolean hypercube.

We give rigidity results for the discrete Bonnet-Myers diameter bound and the Lichnerowicz eigenvalue estimate. Both inequalities are sharp if and only if the underlying graph is a hypercube. The proofs use well-known semigroup methods as well as new direct methods which translate curvature to combinatorial properties.…

2017-05-18abs ↗pdf ↗

Adaptive SAA solves large-scale stochastic linear programs efficiently.

problem Solving large-scale two-stage stochastic linear programs.
method Iterative algorithm with adaptive sample size and warm starts.
result The algorithm converges to the true solution set with a probabilistic guarantee.

In hypercube approach to correlation functions in Chern-Simons theory (knot polynomials) the central role is played by the numbers of cycles, in which the link diagram is decomposed under different resolutions. Certain functions of these numbers are further interpreted as dimensions of graded spaces, associated with hy…

2015-08-08abs ↗pdf ↗

The study finds a diameter bound for graphs with positive entropic Ricci curvature, with optimal bounds for arithmetic mean.

problem Finding diameter bounds for graphs with positive entropic Ricci curvature.
method Using a localized gradient estimate and an equivalent definition of entropic Ricci curvature, the study derives a Bonnet-Myers type diameter bound.
result The derived diameter bound is optimal for arithmetic mean, but not for logarithmic mean.

Surveying mean curvature flow on solvmanifolds, focusing on translating solutions.

problem Understanding translating solutions on solvmanifolds.
method Exploration of mean curvature flow, introduction of translating solutions, discussion of solvmanifolds.
result Equations describing translating solutions on the family of 3D solvmanifolds.

ALMAB-DC optimizes expensive black-box experiments using active learning and distributed computing.

problem Efficiently optimizing expensive, gradient-free objectives in computational statistics and machine learning.
method Combines active learning, multi-armed bandits, and distributed asynchronous computing.
result Achieves lower simple regret and superior performance in various tasks compared to non-ALMAB baselines.

Recent work has shown that a country's productive structure constrains its level of economic growth and income inequality. Here, we compare the productive structure of countries in Latin America and the Caribbean (LAC) with that of China and other High-Performing Asian Economies (HPAE) to expose the increasing gap in t…

2017-01-13abs ↗pdf ↗

This article is an expanded version of the talk given by Ch. O. at the Second Latin Congress on "Symmetries in Geometry and Physics" in Curitiba, Brazil in December 2010. In this version we explain the topological and gauge-theoretical aspects of our paper "Abelian Yang-Mills theory on Real tori and Theta divisors of K…

2011-12-26abs ↗pdf ↗

Study shows current simulations are insufficient for optimal neural network training in cosmology.

problem Insufficient training data for neural networks in cosmological inference.
method Empirical neural scaling law and Cramer-Rao bound to forecast training simulations needed.
result Current simulation suites do not provide sufficient training data for optimal neural network performance.

RL controls small soccer robots in a real league, beating human-designed policies.

problem Training robots to play complex, real-world sports.
method Sim-to-Real RL approach, training in simulated environment, applying to real-world robots.
result Robots learned policies to compete effectively, beating human-designed strategies.