This is a technical report which explores the estimation methodologies on hyper-parameters in Markov Random Field and Gaussian Hidden Markov Random Field. In first section, we briefly investigate a theoretical framework on Metropolis-Hastings algorithm. Next, by using MH algorithm, we simulate the data from Ising model…
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
48 results for “Random Parameters”
A Modified Bayesian Optimization based Hyper-Parameter Tuning Approach for Extreme Gradient Boostingcs.LG
A new Randomized-Hyperopt method improves XGBoost hyperparameter tuning.
problem Improving the performance of XGBoost through hyperparameter optimization.
method Proposes Randomized-Hyperopt for XGBoost hyperparameter tuning.
result Randomized-Hyperopt outperforms other methods in terms of accuracy and execution time.
Random complexes can be embedded linearly if certain conditions on parameters are met.
problem Embedding random simplicial complexes linearly in Euclidean space.
method Established strict inequalities on parameters for linear embedding into R^(2d).
result Necessary and sufficient conditions for linear embedding of random complexes.
In this work, a method of random parameters generation for randomized learning of a single-hidden-layer feedforward neural network is proposed. The method firstly, randomly selects the slope angles of the hidden neurons activation functions from an interval adjusted to the target function, then randomly rotates the act…
A new method to prune neural networks with iterative randomization improves efficiency.
problem Efficiency in pruning randomly initialized neural networks.
method Iteratively randomizing weight values to reduce parameter requirements.
result The method achieves remarkable performance with fewer parameters.
This paper improves GP-UCB by using a shifted exponential distribution for confidence parameters.
problem Theoretical confidence parameter in GP-UCB increases with iterations, leading to large values.
method Introduced IRGP-UCB, a randomized variant of GP-UCB using a shifted exponential distribution for confidence parameters.
result IRGP-UCB achieves sub-linear regret without increasing the confidence parameter.
Graph embedding methods represent nodes in a continuous vector space, preserving information from the graph (e.g. by sampling random walks). There are many hyper-parameters to these methods (such as random walk length) which have to be manually tuned for every graph. In this paper, we replace random walk hyper-paramete…
RODE-Net learns ODEs from data with random parameters using neural networks and GANs.
problem Learning ODEs from data with unknown and random parameters.
method RODE-Net combines symbolic networks and GANs to estimate both the ODE and its parameters.
result RODE-Net can accurately estimate the distribution of model parameters and make reliable predictions.
Random forests are among the most popular classification and regression methods used in industrial applications. To be effective, the parameters of random forests must be carefully tuned. This is usually done by choosing values that minimize the prediction error on a held out dataset. We argue that error reduction is o…
Model captures external influences through random parameters and regime switching.
problem Capturing external influences in asset dynamics with uncertainty and regime changes.
method Developed a stochastic model with random parameters and regime switching, mathematically consistent and interpretable.
result Demonstrated the model's versatility through local volatility models and characteristic functions.
The Random Parameters model was proposed to explain the structure of the covariance matrix in problems where most, but not all, of the eigenvalues of the covariance matrix can be explained by Random Matrix Theory. In this article, we explore other properties of the model, like the scaling of its PDF as one take larger …
Alpha-trimming prunes trees in random forests to improve predictive performance.
problem Improving predictive performance of random forests by locally adaptive tree pruning.
method Alpha-trimming is a fast pruning algorithm that prunes trees in a random forest based on signal-to-noise ratio, controlled by a tuning parameter.
result Alpha-trimming often lowers mean squared prediction error compared to fully grown random forests.
Training only BatchNorm parameters achieves surprisingly high performance in deep networks.
problem Understanding the role and expressive power of affine parameters in BatchNorm.
method Investigating performance when training only BatchNorm parameters and freezing all other weights.
result BatchNorm achieves high performance by learning to disable around a third of random features.
A New Type Of Upper And Lower Bounds On Right-Tail Probabilities Of Continuous Random Variablesmath.PR
New bounds on continuous random variables' right-tail probabilities.
problem Finding precise upper and lower limits for right-tail probabilities of continuous random variables.
method Developed new bounds based on PDF, first derivative, and two parameters.
result The new bounds are tight for various continuous random variables.
The standard method of generating random weights and biases in feedforward neural networks with random hidden nodes, selects them both from the uniform distribution over the same fixed interval. In this work, we show the drawbacks of this approach and propose a new method of generating random parameters. This method en…
Express Wavenet is an improved optical diffractive neural network. At each layer, it uses wavelet-like pattern to modulate the phase of optical waves. For input image with n2 pixels, express wavenet reduce parameter number from O(n2) to O(n). Only need one percent of the parameters, and the accuracy is still very high.…
New method for faster graph parameter inference from large random Kronecker graphs.
problem Efficiently infer graph parameters from large random Kronecker graphs.
method Decompose adjacency matrix into signal and noise components, then use denoising and solving approach.
result Proposed method achieves comparable or better performance than existing methods at lower computational cost.
Efficient Parameter Estimation for Bayesian Network Classifiers using Hierarchical Linear Smoothingcs.LG
A new method for efficient BNC parameter estimation outperforms HDP smoothing.
problem Efficiently estimating parameters for Bayesian network classifiers to match or exceed random forest performance.
method Uses log-linear regression to approximate hierarchical Dirichlet process (HDP) smoothing, making the approach simpler and faster.
result Our method outperforms HDP smoothing while being orders of magnitude faster and competitive with random forests.
Random forests with attention and self-attention improve regression performance.
problem Improving regression model performance on various datasets.
method Proposes new models using attention and self-attention mechanisms to solve regression problems.
result The models improve model performance on many datasets.
Learning the parameters of a (potentially partially observable) random field model is intractable in general. Instead of focussing on a single optimal parameter value we propose to treat parameters as dynamical quantities. We introduce an algorithm to generate complex dynamics for parameters and (both visible and hidde…
Investigates multifractal scaling in critical dynamics of random surfaces.
problem Analyzing multifractal scaling in critical dynamics of random surfaces.
method Examined multifractal scaling in various conformal field theories on random surfaces.
result Higher moments of time variations of the order parameter exhibit multifractal scaling.
While a wide range of interpretable generative procedures for graphs exist, matching observed graph topologies with such procedures and choices for its parameters remains an open problem. Devising generative models that closely reproduce real-world graphs requires domain knowledge and time-consuming simulation. While e…
WRS improves CNN hyperparameter optimization.
problem Finding optimal hyperparameters for CNNs efficiently.
method Combination of Random Search and probabilistic greedy heuristic.
result WRS outperforms other methods in CNN hyperparameter optimization.
We propose reinforcement learning on simple networks consisting of random connections of spiking neurons (both recurrent and feed-forward) that can learn complex tasks with very little trainable parameters. Such sparse and randomly interconnected recurrent spiking networks exhibit highly non-linear dynamics that transf…
Bayesian optimization adapts domain parameters for more robust robot policies.
problem Learning policies for robot control from simulation data often fails in the real world due to the 'reality gap'.
method Bayesian Domain Randomization (BayRn) uses Bayesian optimization to adapt domain parameter distributions during training.
result BayRn achieves better sim-to-real transfer compared to fixed distribution methods.
We introduce a new embarrassingly parallel parameter learning algorithm for Markov random fields with untied parameters which is efficient for a large class of practical models. Our algorithm parallelizes naturally over cliques and, for graphs of bounded degree, its complexity is linear in the number of cliques. Unlike…
Randomized gradient-based ensemble improves prediction accuracy.
problem Improving prediction accuracy in machine learning.
method Randomization and gradient-based aggregation of weakly-correlated estimators.
result The method outperforms existing techniques in terms of increased accuracy.
Randomizes AD models for better option pricing.
problem Inconsistent option pricing with affine models.
method Randomization of AD models with exogenous stochasticity.
result RAnD models allow for better calibration and consistent pricing.
Many popular random partition models, such as the Chinese restaurant process and its two-parameter extension, fall in the class of exchangeable random partitions, and have found wide applicability in model-based clustering, population genetics, ecology or network analysis. While the exchangeability assumption is sensib…
Randomized methods of neural network learning suffer from a problem with the generation of random parameters as they are difficult to set optimally to obtain a good projection space. The standard method draws the parameters from a fixed interval which is independent of the data scope and activation function type. This …
BoostForest combines multiple BoostTree models for improved accuracy.
problem Improving ensemble learning performance.
method BoostTree uses gradient boosting and random cut-points. BoostForest bootstraps training data and randomly samples parameters.
result BoostForest outperforms classical ensemble methods on 35 datasets.
New algorithms improve community detection and parameter estimation for PABM.
problem Improving community detection and parameter estimation for PABM.
method Connecting PABM to GRDPG, constructing new algorithms, and deriving asymptotic properties.
result Absolute number of community detection errors tends to zero as graph vertices increase.
LARF improves random forests with attention mechanisms and contamination models.
problem Improving accuracy in classification tasks with random forests.
method Introduces a two-level attention mechanism and uses a mixture of contamination models.
result Significantly improved classification performance on various datasets.
The main result of this paper is a probabilistic proof of the penalty method for approximating the price of an American put in the Black-Scholes market. The method gives a parametrized family of partial differential equations, and by varying the parameter the corresponding solutions converge to the price of an American…
TOO optimizes stochastic epidemiological models by finding both parameter settings and random seeds.
problem Calibrating stochastic epidemiological models to match empirical observations.
method Gaussian process surrogates and Thompson sampling for optimization.
result Produces actual trajectories consistent with ground truth.
Bandlimited random neural networks may not approximate all functions perfectly.
problem Expressive power of shallow neural networks with bandlimited random weights.
method Ridgelet analysis for deriving approximation error lower bounds.
result Bandlimited random weights can lead to non-zero approximation error.
A new method averages neural network parameters to rank features robustly.
problem Neural networks' sensitivity to random initialization affects feature ranking robustness.
method Parameter averaging of multiple shallow networks trained with different random seeds.
result The averaged model discovers ground-truth feature importance consistently.
Collaborative learning allows participants to jointly train a model without data sharing. To update the model parameters, the central server broadcasts model parameters to the clients, and the clients send updating directions such as gradients to the server. While data do not leave a client device, the communicated gra…
Study reveals convergence properties of SGD with random learning rate.
problem Analyzing convergence of SGD with random learning rate in non-convex optimization.
method Introduced Poisson SGD with random learning rate and used stationary distribution analysis.
result Poisson SGD converges to a stationary distribution and finds global minima in non-convex optimization.
Random Projections and Natural Sparsity in Time-Series Classification: A Theoretical Analysisstat.ML
Rocket algorithm classifies time-series data efficiently using random projections and natural sparsity.
problem Time-series classification challenges in diverse fields.
method Random convolutional kernels, non-linear transformation, compressed sensing framework.
result Rocket algorithm preserves discriminative patterns in time-series data and expresses inherent sparsity.
New spectral algorithm estimates random graph parameters robustly against corrupted nodes.
problem Estimating the parameter of an Erdős-Rényi random graph with adversarial corruption.
method Spectral algorithm designed for computational efficiency, with an inefficient but information-theoretic alternative.
result Achieves optimal error rate up to logarithmic factors, matching statistical lower bounds.
Mean Field Portfolio Gamesq-fin.MF
Study Nash equilibrium in mean field portfolio games with random market parameters.
problem Modeling wealth and relative performance in competitive financial markets.
method Martingale optimality principle approach to characterize Nash equilibrium in mean field FBSDE.
result Unique Nash equilibrium found under weak interaction assumption and market parameters independence.
This paper develops quantization algorithms for random Fourier features, simplifying the process and improving performance.
problem Efficient quantization of random Fourier features for better performance and storage.
method Developed Lloyd-Max (LM) and LM-RFF quantization schemes for random Fourier features.
result The marginal distribution of RFF is independent of the Gaussian kernel parameter γ, simplifying quantization design.
Study extends bounds on sample covariance matrices with general dependence.
problem Quantitative bounds on sample covariance matrices with i.i.d. columns.
method Extends previous work on deterministic equivalent to rectangular random matrices with general dependence structure.
result Proves quantitative bounds involving dimensions and spectral parameter, including closer proximity to real positive semi-line.
A generalized continuous economic model is proposed for random markets. In this model, agents interact by pairs and exchange their money in a random way. A parameter controls the effectiveness of the transactions between the agents. We show in a rigorous way that this type of markets reach their asymptotic equilibrium …
Recently, reinforcement learning (RL) algorithms have demonstrated remarkable success in learning complicated behaviors from minimally processed input. However, most of this success is limited to simulation. While there are promising successes in applying RL algorithms directly on real systems, their performance on mor…
Develops ML tool for macroeconomic forecasting with clear interpretations.
problem Forecasting and understanding macroeconomic parameters over time.
method Macroeconomic Random Forest (MRF) algorithm, Generalized Time-Varying Parameters (GTVPs).
result Clear forecasting gains and accurate predictions of unemployment and inflation.
Framework for uncertainty estimation in training parameters.
problem Estimating uncertainty in training parameters.
method Marginalizing hyperparameters as random variables, investigating various forms of marginalisation.
result Some marginalisations can reliably estimate uncertainty without extensive tuning.