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

83166249332 · Jun 202019922001200920172026
48 results for fractional factorial design

Designs efficient factorial experiments for product design under budget constraints.

problem Designing effective experiments for product design with limited traffic and overlapping experiments.
method Two-stage design: first stage samples and infers performance, second stage selects a final policy.
result The method outperforms one-shot tensor completion and unstructured best-arm benchmarks.

New method uses Rashomon sets to improve Bayesian inference in factorial designs.

problem Combustion of model uncertainty in factorial designs leads to multimodal posterior and convergence issues.
method Rashomon-seeded annealing, integrating high-performing models as warm start for AIS.
result Restores full posterior inference without exhaustive enumeration of model space.

DABS uses a policy network to select experiments in high-dimensional design spaces.

problem Adaptive factorial screening in high-dimensional discrete design spaces.
method DABS learns a policy network offline to sequentially select experiments, incorporating sparsity and interactions via a spike-and-slab prior.
result DABS achieves superior accuracy and scalability over classical and Bayesian baselines under tight experimental budgets.

New findings show single-treatment effects are unidentifiable in factorial experiments.

problem Identifying the effect of a single intervention in factorial experiments.
method Formalized sufficient conditions for the identifiability of single-treatment effects and developed nonparametric sharp bounds.
result Researchers must justify assumptions for extrapolating single-treatment effects.

A new experimental design method for combinatorial interventions reduces complexity and improves accuracy.

problem Efficiently conducting all possible combinatorial interventions with multiple treatments and potential interactions.
method Probabilistic factorial experimental design, applying random combinations of treatments and adapting over multiple rounds.
result Optimal dosage of 1/2 for each treatment yields near-optimal design for estimating any k-way interaction model.

In this paper, we develop a parameter estimation method for factorially parametrized models such as Factorial Gaussian Mixture Model and Factorial Hidden Markov Model. Our contributions are two-fold. First, we show that the emission matrix of the standard Factorial Model is unidentifiable even if the true assignment ma…

2015-08-18abs ↗pdf ↗

Unsupervised machine learning helps design complex experiments more efficiently.

problem Designing experiments with many factors and constraints is challenging and costly.
method Applied a beta variational autoencoder (beta-VAE) to represent trials in a low-dimensional latent space.
result Generated pragmatic designs with fewer trials while maintaining objectives.

We study a novel spline-like basis, which we name the "falling factorial basis", bearing many similarities to the classic truncated power basis. The advantage of the falling factorial basis is that it enables rapid, linear-time computations in basis matrix multiplication and basis matrix inversion. The falling factoria…

2014-05-03abs ↗pdf ↗

Bayesian neural networks improve uncertainty estimation in 3D point cloud segmentation for factory planning.

problem Improving uncertainty estimation in 3D point cloud segmentation for factory planning.
method Proposed fully Bayesian and approximate Bayesian neural networks for point cloud segmentation.
result Superior model performance and improved segmentation results with uncertainty incorporation.

Neural networks learn more efficiently with hidden factorial structures.

problem Challenges in high-dimensional statistical learning.
method Controlled experimental framework to test neural networks' ability to exploit hidden factorial structures.
result Neural networks can leverage hidden factorial structures to learn discrete distributions more efficiently.

Factorial moments are convenient tools in nuclear physics to characterize the multiplicity distributions when phase-space resolution (ΔΔ) becomes small. For uncorrelated particle production within ΔΔ, Gaussian statistics holds and factorial moments FqF_q are equal to unity for all orders qq. Correlations between par…

2011-08-29abs ↗pdf ↗

High-throughput 3D control training system achieves 100,000 FPS.

problem Lack of efficient, single-machine reinforcement learning systems.
method Sample Factory combines asynchronous sampling and off-policy correction.
result Achieves 100,000 FPS on 3D control problems without sacrificing sample efficiency.

Factorial moments are convenient tools in particle physics to characterize the multiplicity distributions when phase-space resolution (ΔΔ) becomes small. They include all correlations within the system of particles and represent integral characteristics of any correlation between these particles. In this letter, we sh…

2011-08-30abs ↗pdf ↗

We propose algorithms for approximate filtering and smoothing in high-dimensional Factorial hidden Markov models. The approximation involves discarding, in a principled way, likelihood factors according to a notion of locality in a factor graph associated with the emission distribution. This allows the exponential-in-d…

2019-02-05abs ↗pdf ↗

We prove the factoriality of the following nodal threefolds: a complete intersection of hypersurfaces FF and GP5G\subset\mathbb{P}^{5} of degree nn and kk respectively, where GG is smooth, Sing(FG)(n+k2)(n1)/5|\mathrm{Sing}(F\cap G)|\leqslant(n+k-2)(n-1)/5, nkn\geqslant k; a double cover of a smooth hypersurface $F\subset\mathbb{P}^{…

2004-10-10abs ↗pdf ↗

This paper introduces the factorial marked temporal point process model and presents efficient learning methods. In conventional (multi-dimensional) marked temporal point process models, event is often encoded by a single discrete variable i.e. a marker. In this paper, we describe the factorial marked point processes w…

2018-01-21abs ↗pdf ↗

Bayesian segmentation and uncertainty estimation improve 3D model accuracy for factory planning.

problem Generating accurate 3D models from outdated and incomplete 2D data.
method Bayesian neural network for point cloud segmentation and entropy-based uncertainty estimation.
result Bayesian segmentation network significantly improves model accuracy and object identification.

MAFLA improves sampling from heavy-tailed distributions using MH-inspired corrections.

problem Sampling from heavy-tailed and multimodal distributions when neither target nor proposal densities can be evaluated.
method Metropolis-Adjusted Fractional Langevin Algorithm (MAFLA) with Score Balance Matching.
result MAFLA significantly improves finite-time sampling accuracy over unadjusted fractional Langevin dynamics.

Study evaluates discretized arbitrage strategies in fractional financial markets.

problem Serial correlation in financial markets with fractional Brownian motion.
method Revisit and transfer Shiryaev and Salopek's strategies to a real-world setting, distretizing dynamics and introducing transaction costs.
result Both strategies are promising with respect to terminal portfolio values and loss probabilities.

We assume that a high-dimensional datum, like an image, is a compositional expression of a set of properties, with a complicated non-linear relationship between the datum and its properties. This paper proposes a factorial mixture prior for capturing latent properties, thereby adding structured compositionality to deep…

2018-12-18abs ↗pdf ↗

Bayesian inference for factorial hidden Markov models is challenging due to the exponentially sized latent variable space. Standard Monte Carlo samplers can have difficulties effectively exploring the posterior landscape and are often restricted to exploration around localised regions that depend on initialisation. We …

2017-03-24abs ↗pdf ↗

New neural operators model turbulence with memory and randomness.

problem Modeling turbulence in complex fluid dynamics with memory and randomness.
method Symmetrized activation functions, fractional derivatives, and stochastic noise.
result Theoretical guarantees for approximation quality in turbulent phenomena.

A new approach to sensitivity analysis without the Sobol decomposition.

problem Traditional sensitivity indices like Sobol indices have limitations.
method Introducing sensitivity measures that generalize existing indices and define interaction effects.
result Sensitivity measures can create new indices and define interaction effects.

The paper describes a cover of strata of k-differentials with a formula for fiber cardinality.

problem Understanding the ramification locus and cardinality of fibers in strata of k-differentials.
method Intersection calculations on multi-scale compactification and flat geometry.
result A formula for the cardinality of each fiber involving the k-factorial function.

New robust regression method works with fewer data points than previous methods.

problem Adversary can corrupt most of the data, making traditional regression models unreliable.
method Developed a Huber loss estimator for robust linear regression with nearly linear sample size and inverse-polynomial inlier fraction.
result The Huber loss estimator is consistent for nearly linear sample size and inverse-polynomial inlier fraction.