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

326496128 · Jun 202019922001200920172026
48 results for data-rich environment

Study binary choice with asymmetric loss, offering simple solutions.

problem Binary choice with asymmetric loss in data-rich environments.
method Loss-based reweighting of logistic regression or machine learning techniques.
result Valid decisions on binary outcomes with general loss functions.

TSML tackles anomaly detection and pattern discovery in industrial time series data.

problem Extracting and exploiting information from large industrial data to reduce downtimes and manufacturing errors.
method TSML uses a pipeline of lightweight filters to process industrial time series data in parallel.
result TSML effectively detects anomalies and discovers patterns in industrial time series data.

Estimates linear model from noisy covariates and instruments using spectral regularization.

problem Estimating a linear model from many noisy covariates and instruments.
method Two-stage least squares with spectral regularization of canonical correlations.
result Upper and lower bounds on estimation error, proving optimality of the method with noisy data.

The paper evaluates various forecasting methods for inflation, finding ML models superior.

problem Forecasting inflation using disaggregated data and machine learning.
method Examines traditional and machine learning models, including random forest, for disaggregated and aggregated inflation forecasts.
result Aggregating disaggregated forecasts performs similarly to survey-based expectations and aggregate models.

Machine Learning improves macroeconomic forecasting by capturing nonlinearities.

problem Improving macroeconomic forecasting accuracy.
method Study four features (nonlinearities, regularization, cross-validation, loss function) in data-rich and data-poor environments.
result Nonlinearity is the key to improving forecasting accuracy.

We develop a novel "decouple-recouple" dynamic predictive strategy and contribute to the literature on forecasting and economic decision making in a data-rich environment. Under this framework, clusters of predictors generate different latent states in the form of predictive densities that are later synthesized within …

2018-03-18abs ↗pdf ↗

In this paper, we provide efficient estimators and honest confidence bands for a variety of treatment effects including local average (LATE) and local quantile treatment effects (LQTE) in data-rich environments. We can handle very many control variables, endogenous receipt of treatment, heterogeneous treatment effects,…

2013-11-11abs ↗pdf ↗

A large number of online services provide automated recommendations to help users to navigate through a large collection of items. New items (products, videos, songs, advertisements) are suggested on the basis of the user's past history and --when available-- her demographic profile. Recommendations have to satisfy the…

2013-01-08abs ↗pdf ↗

Automating the customer analytics process is crucial for companies that manage distinct customer bases. In such data-rich and dynamic environments, visualization plays a key role in understanding events of interest. These ideas have led to the popularity of analytics dashboards, yet academic research has paid scant att…

2015-11-17abs ↗pdf ↗

Study evaluates machine learning methods for large-scale network reliability, revealing ANN's and PR's performance.

problem Tackles the NP-hard problem of approximating binary-state network reliability for large-scale systems.
method Compares 20 machine learning methods across three reliability regimes and evaluates their performance on large-scale networks.
result Large-scale networks with arc reliability ≥ 0.9 exhibit near-unity system reliability, enabling computational simplifications.

The Hodrick-Prescott (HP) filter is one of the most widely used econometric methods in applied macroeconomic research. Like all nonparametric methods, the HP filter depends critically on a tuning parameter that controls the degree of smoothing. Yet in contrast to modern nonparametric methods and applied work with these…

2019-05-01abs ↗pdf ↗

We consider a firm that sells products over TT periods without knowing the demand function. The firm sequentially sets prices to earn revenue and to learn the underlying demand function simultaneously. A natural heuristic for this problem, commonly used in practice, is greedy iterative least squares (GILS). At each ti…

2016-04-25abs ↗pdf ↗

Neuroscience is undergoing faster changes than ever before. Over 100 years our field qualitatively described and invasively manipulated single or few organisms to gain anatomical, physiological, and pharmacological insights. In the last 10 years neuroscience spawned quantitative big-sample datasets on microanatomy, syn…

2016-08-05abs ↗pdf ↗

Many data-rich industries are interested in the efficient discovery and modelling of structures underlying large data sets, as it allows for the fast triage and dimension reduction of large volumes of data embedded in high dimensional spaces. The modelling of these underlying structures is also beneficial for the creat…

2019-09-27abs ↗pdf ↗

Sparse alpha-norm regularization has many data-rich applications in Marketing and Economics. Alpha-norm, in contrast to lasso and ridge regularization, jumps to a sparse solution. This feature is attractive for ultra high-dimensional problems that occur in demand estimation and forecasting. The alpha-norm objective is …

2017-09-01abs ↗pdf ↗

Develops methods to simulate rare transitions in molecular systems.

problem Rare transitions between metastable states in molecular systems are difficult to study due to limited data.
method Two novel methods: chain-based and midpoint-based approaches.
result Demonstrates effectiveness of methods in both data-rich and data-scarce scenarios.

While the volume of electronic health records (EHR) data continues to grow, it remains rare for hospital systems to capture dense physiological data streams, even in the data-rich intensive care unit setting. Instead, typical EHR records consist of sparse and irregularly observed multivariate time series, which are wel…

2018-12-03abs ↗pdf ↗

Evaluates transfer learning methods in dynamic data availability scenarios.

problem Real-world data availability varies over time, leading to unrealistic TL method evaluations.
method Proposes a data manipulation framework to simulate varying data availability and domain transformations.
result Demonstrates the usefulness of the framework on proprietary and publicly available datasets.

New bounds for high-dimensional sparse linear bandits, balancing information and regret.

problem Stochastic linear bandits with high-dimensional sparse features.
method Derivation of minimax regret lower and upper bounds for explore-then-commit algorithm.
result Optimal rate of Θ(n2/3)Θ(n^{2/3}) for data-poor regime, complemented by O(n)O(\sqrt{n}) under signal magnitude assumption.

CoreFlow models matrix-valued distributions efficiently, preserving shared low-rank structure.

problem Learning matrix-valued distributions from high-dimensional and incomplete data.
method Low-rank flow model that learns shared row/column subspaces and trains a normalizing flow on the core.
result CoreFlow improves generation quality in few-sample regimes and remains competitive in data-rich settings.

New ASR system handles multiple languages without needing language-specific encoding.

problem Joint training of data-rich and data-scarce languages in a single model.
method Transforms all languages to a single writing system through transliteration, separating modeling and rendering.
result Language-agnostic multilingual ASR system reduces WER up to 10% over language-dependent models.

OBSER framework infers sub-environments from objects, outperforming scene-based methods.

problem Zero-shot recognition of environments from object distributions.
method Bayesian framework using metric and self-supervised learning models to estimate object distributions in latent space.
result OBSER framework reliably performs inference in open-world and photorealistic environments, outperforming scene-based methods.

New approach handles stochastic and partially-observable environments using discrete autoencoders and Monte Carlo tree search.

problem Challenges in planning for stochastic and partially-observable environments.
method Uses discrete autoencoders and a stochastic variant of Monte Carlo tree search.
result Significantly outperforms MuZero on stochastic chess and scales to DeepMind Lab.

This paper introduces CENIE to quantify environment novelty for better UED.

problem Challenges in measuring environment novelty for effective UED.
method CENIE framework using state-action space coverage and Gaussian Mixture Models.
result CENIE improves UED performance across multiple benchmarks.

Convolutional neural networks learn effective summary statistics for ABC inference.

problem Selecting high-quality summary statistics for accurate ABC inference in complex systems.
method Proposes a CNN architecture to automatically learn informative summary statistics from time series data.
result CNNs can effectively circumvent the statistics selection problem in ABC inference.

Infinite hierarchical contrastive clustering identifies personal environments linked to health outcomes.

problem Identifying meaningful relationships between environmental features and health outcomes on an individual level.
method Contrastive clustering framework with stick-breaking prior and participant-specific prediction loss.
result Model effectively identifies distinct personal environments and groups them into meaningful types linked to health outcomes.

Research shows collective learning across diverse environments is hard due to privacy and security concerns.

problem Privacy, security, and equity concerns restrict information sharing in diverse AI environments.
method Characterized learning algorithms as choice correspondences, provided minimum requirements for rational learning algorithms.
result The only rational learning algorithm in heterogeneous environments is unilaterally learning from a single environment without information sharing.

LEADS improves model generalization across different environments.

problem Modeling dynamical systems from varied environments leads to biased or scarce solutions.
method LEADS learns a shared model capturing common dynamics and additional terms for environment-specific dynamics.
result LEADS improves model generalization for both known and novel environments.