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

19395877 · Jun 202019922001200920172026
48 results for serve strength

This paper improves prediction uncertainty estimation by inferring variation from neuron activation strength.

problem Estimating prediction uncertainty from ensemble methods is expensive and inaccurate.
method Introduced randomness into model training and inferred prediction variation from neuron activation strength.
result Average R squared on MovieLens is 0.56 and on Criteo is 0.81, with strong performance in variation detection.

Empirical analysis serves as an important complement to theoretical analysis for studying practical Bayesian optimization. Often empirical insights expose strengths and weaknesses inaccessible to theoretical analysis. We define two metrics for comparing the performance of Bayesian optimization methods and propose a ran…

2016-03-31abs ↗pdf ↗

New framework predicts earnings announcements using press release content, surpassing earnings surprises.

problem Predicting stock returns based on earnings press releases.
method Compared traditional and BERT-based embeddings of press releases, finding content as informative as earnings surprises.
result FinBERT yields highest predictive power for earnings announcement returns.

Consistent estimator derived for confounding strength in observational data.

problem Estimating confounding strength in observational data is challenging due to unobserved confounders.
method Derived and adapted a consistent estimator using tools from random matrix theory.
result The original estimator is not consistent, but an adapted one is.

Nesterov's extrapolation improves convergence in nonsmooth optimization.

problem Improving convergence rate in nonsmooth convex optimization.
method Nesterov's extrapolation applied to projected subgradient methods.
result Nesterov's extrapolation optimizes individual convergence for nonsmooth problems.

Generative model learns to mimic time-series behavior to generate accurate trajectories.

problem Learning generative models for time-series data with accurate multi-step trajectories.
method Contrastive imitation framework combining autoregressive and adversarial elements.
result The method generates accurate and useful samples from real-world datasets.

Data integration methods that analyze multiple sources of data simultaneously can often provide more holistic insights than can separate inquiries of each data source. Motivated by the advantages of data integration in the era of "big data", we investigate feature selection for high-dimensional multi-view data with mix…

2019-03-27abs ↗pdf ↗

Understanding tie strength in social networks, and the factors that influence it, have received much attention in a myriad of disciplines for decades. Several models incorporating indicators of tie strength have been proposed and used to quantify relationships in social networks, and a standard set of structural networ…

2017-10-11abs ↗pdf ↗

Novel method uses information theory to measure causal influences during transient neural events.

problem Characterizing network interactions during transient neural events.
method Structural Causal Models, Information Theory, Transfer Entropy, Dynamic Causal Strength, Relative Dynamic Causal Strength.
result Introduced a novel measure, relative Dynamic Causal Strength, with theoretical and empirical support.

This paper calculates interaction strength for translation surfaces with multiple singularities.

problem Computing the interaction strength of translation surfaces with multiple singularities is challenging.
method The authors study interaction strength of specific families of translation surfaces, including regular polygons and Bouw-Möller surfaces.
result The paper provides exact computations of KVol on translation surfaces with multiple singularities.

Nested sampling is a powerful technique for exploring high-likelihood regions, but its theoretical derivation is complex and involves approximations.

problem Sampling from likelihood-constrained priors in nested sampling
method Providing a comprehensive and detailed exposition of nested sampling derivation and practical challenges
result Deepening understanding of nested sampling and fostering future enhancements

The paper addresses adversarial robustness in in-context learning models.

problem Adversarial distribution shifts threaten the reliability of in-context learning models.
method A distributionally robust meta-learning framework is introduced to provide worst-case performance guarantees under Wasserstein-based distribution shifts.
result Model robustness scales with the square root of its capacity and is penalized by the square of the perturbation magnitude.

Neural program embedding can be helpful in analyzing large software, a task that is challenging for traditional logic-based program analyses due to their limited scalability. A key focus of recent machine-learning advances in this area is on modeling program semantics instead of just syntax. Unfortunately evaluating su…

2019-05-27abs ↗pdf ↗

A new method uses randomized trials to estimate the strength of unobserved confounding.

problem Unobserved confounding compromises causal conclusions from non-randomized studies.
method Designs a statistical test to detect unobserved confounding strength and estimates a lower bound.
result Estimates an asymptotically valid lower bound on unobserved confounding strength.

Convolutional Neural Networks(CNNs) are both computation and memory intensive which hindered their deployment in mobile devices. Inspired by the relevant concept in neural science literature, we propose Synaptic Pruning: a data-driven method to prune connections between input and output feature maps with a newly propos…

2018-11-06abs ↗pdf ↗

Benchmark for UDA in time series classification.

problem Lack of benchmarks for unsupervised domain adaptation in time series.
method Introduces a comprehensive benchmark with new datasets and state-of-the-art neural network backbones.
result Insights into strengths and limitations of UDA methods for time series data.

While the Machine Learning (ML) landscape is evolving rapidly, there has been a relative lag in the development of the "learning systems" needed to enable broad adoption. Furthermore, few such systems are designed to support the specialized requirements of scientific ML. Here we present the Data and Learning Hub for sc…

2018-11-27abs ↗pdf ↗

The paper examines how spike strengths and alignments affect overfitting in linear regression models.

problem The impact of spike strengths and alignments on overfitting in linear regression models.
method Characterization of generalization error through exact expressions and analysis of spike strengths, aspect ratio, and target alignment.
result Increasing spike strength can lead to catastrophic overfitting before benign overfitting, especially in well-specified aligned problems.

We propose an original model for inferring team strengths using a Markov Random Field, which can be used to generate historical estimates of the offensive and defensive strengths of a team over time. This model was designed to be applied to sports such as soccer or hockey, in which contest outcomes take value in a limi…

2013-05-09abs ↗pdf ↗

DECE visualizes machine learning decisions with counterfactual explanations.

problem Making machine learning models transparent and explainable.
method Interactive visualization system supporting counterfactual explanations at instance- and subgroup-levels.
result DECE enables users to explore and understand machine learning model decisions.

We present a simple model of firm rating evolution. We consider two sources of defaults: individual dynamics of economic development and Potts-like interactions between firms. We show that such a defined model leads to phase transition, which results in collective defaults. The existence of the collective phase depends…

2009-04-28abs ↗pdf ↗

We propose a novel method designed for large-scale regression problems, namely the two-stage best-scored random forest (TBRF). "Best-scored" means to select one regression tree with the best empirical performance out of a certain number of purely random regression tree candidates, and "two-stage" means to divide the or…

2019-05-09abs ↗pdf ↗

Predictive modeling is invaded by elastic, yet complex methods such as neural networks or ensembles (model stacking, boosting or bagging). Such methods are usually described by a large number of parameters or hyper parameters - a price that one needs to pay for elasticity. The very number of parameters makes models har…

2018-06-23abs ↗pdf ↗

Financial markets are well known examples of multi-fractal complex systems that have garnered much interest in their characterization through complex network theory. The recent studies have used correlation based distance metrics for defining and analyzing financial networks. In this work the singularity strength is em…

2012-05-08abs ↗pdf ↗

DeepLight accelerates CTR predictions in ad serving by 46X.

problem Significantly increased serving delay and high memory usage for ad serving.
method Explicitly searching feature interactions, pruning layers, promoting sparsity.
result Accelerates model inference by 46X on Criteo dataset.

Peer-induced fairness framework audits algorithmic fairness in AI applications.

problem Current auditing methods lack robustness and fail to distinguish between algorithmic discrimination and subject limitations.
method Combines counterfactual fairness and peer comparison strategy for a reliable auditing tool.
result Demonstrates significant unfairness in micro-firms compared to non-micro firms, highlighting the framework's potential.

HOLMES improves real-time model serving for ICU patients, balancing accuracy and speed.

problem Real-time model serving is crucial in ICU due to urgency and cost.
method Online model ensemble serving framework for healthcare applications.
result HOLMES achieves high accuracy and sub-second latency for model ensemble serving.

Bayes factors and relative belief ratios are compared as measures of statistical evidence.

problem Which measure of evidence is more appropriate: Bayes factors or relative belief ratios?
method Comparison of Bayes factors and relative belief ratios, considering properties and restrictions.
result Relative belief ratio has better properties as a measure of evidence.

Proposes a Coulomb-like model for international trade flows, fitting real-world data.

problem Describing and predicting international trade flows between countries.
method Formulated a coulomb force model where GDP represents charge and distance is influenced by various factors.
result Developed a trade strength distribution equation that fits real-world data well.

New algorithms achieve logarithmic regret in KL-regularized Markov games.

problem Improving sample efficiency in game-theoretic settings with KL regularization.
method Developed OMG and SOMG algorithms for matrix and Markov games, using best response sampling and superoptimistic bonuses.
result Logarithmic regret in TT that scales inversely with KL regularization strength ββ.

Double descent risk in L2-regularized models explained and mitigated.

problem Risk of overparameterized models in machine learning.
method Analysis of L2-regularized models, two-layer neural networks, and CNNs.
result Double descent risk in L2-regularized models can be explained and mitigated by adjusting regularization strengths.

This paper proposes using a linear function approximator, rather than a deep neural network (DNN), to bias a Monte Carlo tree search (MCTS) player for general games. This is unlikely to match the potential raw playing strength of DNNs, but has advantages in terms of generality, interpretability and resources (time and …

2019-03-21abs ↗pdf ↗

SLOE speeds up logistic regression in high dimensions with accurate signal strength estimation.

problem Poor performance of logistic regression in high-dimensional settings.
method SLOE reparameterizes the signal strength for faster and more accurate estimation.
result SLOE provides a fast and accurate method for dimensionality correction in logistic regression.