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

Trend · papers per month

81162243324 · Jun 202019922001200920172026
48 results for aggregate ratings

A firm with heterogeneous shareholders optimizes dividends under ambiguity aggregation.

problem Optimizing dividends for a firm with heterogeneous shareholders under ambiguity aggregation.
method Characterizing equilibrium dividends using a partition of the state space.
result Time-homogeneous equilibrium dividend law characterized by a partition of the state space.

Paper studies fundamental limits of communication in distributed learning.

problem Communication efficiency in model aggregation for distributed learning.
method Rate-Distortion approach to model aggregation as a vector Gaussian CEO problem.
result Derives rate region bound and sum-rate-distortion function for model aggregation.

Let $\cF$ be a set of MM classification procedures with values in [1,1][-1,1]. Given a loss function, we want to construct a procedure which mimics at the best possible rate the best procedure in $\cF$. This fastest rate is called optimal rate of aggregation. Considering a continuous scale of loss functions with various …

2007-03-27abs ↗pdf ↗

The paper introduces a method to control false splits in tree-based data aggregation.

problem Identifying the correct subgroups to treat as a single entity in tree-based data.
method Introduces the 'false split rate' and proposes a multiple hypothesis testing algorithm for tree-based aggregation.
result The proposed algorithm controls the false split rate, demonstrating its effectiveness on stock volatility and taxi fare data.

Study optimal stopping for group with diverse discount rates using an attitude function.

problem Optimal stopping for a group with diverse discount rates under an aggregation preference.
method Develop iterative approach using consistent planning for time-consistent equilibria.
result Characterize all time-consistent mild equilibria as fixed points of an operator.

We introduce an alternative to the notion of `fast rate' in Learning Theory, which coincides with the optimal error rate when the given class happens to be convex and regular in some sense. While it is well known that such a rate cannot always be attained by a learning procedure (i.e., a procedure that selects a functi…

2015-02-25abs ↗pdf ↗

Copula models for sovereign ratings improved by incorporating climate risk.

problem Modeling nonlinear dependence and clustering in sovereign rating migrations.
method Mixed-difference transformation, MAGMAR(1,1) copula process, consistent and asymptotically normal estimators.
result Gumbel MAGMAR(1,1) specification outperforms other models in empirical performance.

Model infers functions for attributes using multi-aggregate datasets with knowledge transfer.

problem Modeling aggregate data with varying granularities and spatial supports.
method Multi-output Gaussian process (MoGP) with linear mixing of independent latent GPs, aggregation process, and prior distribution of mixing weights.
result Proposed model outperforms in refining coarse-grained aggregate data.

A conformal procedure improves CoT reasoning by aggregating reasoning paths and calibrating abstention rules.

problem Aggregation uncertainty in chain-of-thought reasoning makes correct answers less reliable.
method Introduces a conformal procedure for CoT reasoning that uses weighted score aggregation and abstention rules.
result Achieves higher selective accuracy with abstention, reducing confident-error rate.

Paper analyzes sparse aggregation in GLMs with Kullback-Leibler risk bounds.

problem Sparse aggregation in GLMs for parameter approximation.
method Exponential weighted aggregation scheme with Kullback-Leibler risk bounds.
result Sharp oracle inequality for Kullback-Leibler risk with leading constant 1 and minimax-optimal rate of aggregation.

New methods reduce private federated learning communication automatically.

problem Reducing communication in private federated learning.
method Automatic compression rate adjustment based on training error, using secure aggregation and differential privacy.
result Provable instance-optimal for mean estimation, achieving favorable compression rates.

Calibrated models can lead to miscalibrated aggregations in strategic interactions.

problem Miscalibration in aggregated predictions from multiple calibrated models.
method Analysis of strategic interactions between calibrated predictors, proving conditions for miscalibration and comparing VCG and Brier-score aggregation methods.
result VCG aggregation method outperforms Brier-score in strategic settings, providing robustness and comparable accuracy.

Relational probabilistic models have the challenge of aggregation, where one variable depends on a population of other variables. Consider the problem of predicting gender from movie ratings; this is challenging because the number of movies per user and users per movie can vary greatly. Surprisingly, aggregation is not…

2017-07-25abs ↗pdf ↗

Given a finite family of functions, the goal of model selection aggregation is to construct a procedure that mimics the function from this family that is the closest to an unknown regression function. More precisely, we consider a general regression model with fixed design and measure the distance between functions by …

2012-03-12abs ↗pdf ↗

Adaptive Bayesian learning aggregates experts to improve performance.

problem Bayesian online learning's performance depends on inferential choices.
method Treat Bayesian update rules as experts and aggregate them based on sequential predictive losses.
result The aggregate competes with the best expert in hindsight at a low aggregation cost.

Graph edges, along with their labels, can represent information of fundamental importance, such as links between web pages, friendship between users, the rating given by users to other users or items, and much more. We introduce LEAP, a trainable, general framework for predicting the presence and properties of edges on…

2019-03-11abs ↗pdf ↗

AEW estimator achieves optimal risk in expectation for large enough temperatures.

problem Understanding minimax-rate optimality of AEW estimator in model selection aggregation.
method Analyzing AEW estimator with exponential weights for squared loss under random design.
result AEW achieves excess risk Tlog(M)/(n+1)T \log (M) / (n+1) in expectation for large enough temperatures.

We empirically test the effects of unanticipated fiscal policy shocks on the growth rate and the cyclical component of real private output and reveal different types of asymmetries in fiscal policy implementation. The data used are quarterly U.S. observati ons over the period 1967:1 to 2011:4. In doing so, we use both …

2013-12-10abs ↗pdf ↗

Study on convergence of graph neural networks on random graphs.

problem Convergence of message passing graph neural networks on large random graphs.
method Extended convergence results to a broad class of aggregation functions using McDiarmid inequality.
result Non-asymptotic bounds for convergence quantified with high probability.

We consider Feller mean-reverting square-root diffusion, which has been applied to model a wide variety of processes with linearly state-dependent diffusion, such as stochastic volatility and interest rates in finance, and neuronal and populations dynamics in natural sciences. We focus on the statistical mixing (or sup…

2009-10-08abs ↗pdf ↗

Algorithm for online decision making with unknown dynamics and aggregate feedback.

problem Online decision making with unknown dynamics and aggregate bandit feedback.
method Developed an algorithm based on online mirror descent with a self-concordant barrier regularization and an increasing learning rate schedule.
result Achieved O(K)O(\sqrt{K}) regret for the online Markov Decision Process with KK episodes.

Study benchmarks label noise detection methods, identifying best practices.

problem Label noise in real-world datasets affects model performance and evaluation reliability.
method Decomposed detection methods into label agreement, aggregation, and information gathering components; introduced a unified benchmark task and novel metric.
result In-sample probability aggregation with logit margin label agreement function achieves best results across scenarios.

New aggregation methods improve robustness and efficiency in distributed learning.

problem Outliers and malicious agents compromise traditional averaging in distributed learning.
method Developed statistically efficient and robust aggregation schemes based on median and trimmed mean variations.
result Achieved higher sample efficiency compared to traditional robust aggregation schemes.

In this paper, we study the accuracy of values aggregated over classes predicted by a classification algorithm. The problem is that the resulting aggregates (e.g., sums of a variable) are known to be biased. The bias can be large even for highly accurate classification algorithms, in particular when dealing with class-…

2019-02-06abs ↗pdf ↗

LASG improves communication efficiency in distributed learning.

problem Efficiently communicating gradients in distributed machine learning.
method Develops a new stochastic gradient descent approach, LASG, that predicts and selects significant communication rounds.
result Achieves communication savings by an order of magnitude in federated learning.

Federated Learning speeds up speech recognition training by 7x and reduces error rate by 6%.

problem Training acoustic models for speech recognition tasks in a federated manner.
method Hierarchical optimization and dynamic gradient aggregation methods.
result Significant improvement in training convergence speed and model performance.

Early-stopped aggregation improves computational efficiency in adaptive statistical inference.

problem Computational inefficiency in model selection and aggregation for adaptive inference.
method Early-stopped aggregation (ESA) framework: compute only a few simpler models using early-stopping criteria.
result ESA achieves optimal adaptive contraction rates in variational Bayes and frequentist settings.

New bounds on generalization error for distributed learning using rate-distortion theory.

problem Establishing upper bounds on generalization error for distributed learning algorithms.
method Using rate-distortion theory, the paper introduces new bounds that depend on the compressibility of each client's algorithm.
result The bounds suggest that the generalization error of the distributed setting decays faster than that of the centralized one with a factor of O(log(K)/K)\mathcal{O}(\log(K)/\sqrt{K}).

We propose a communication-efficient distributed estimation method for sparse linear discriminant analysis (LDA) in the high dimensional regime. Our method distributes the data of size NN into mm machines, and estimates a local sparse LDA estimator on each machine using the data subset of size N/mN/m. After the distri…

2016-10-15abs ↗pdf ↗

Siegel's paradox is a fundamental question in international finance about exchange rates for futures contracts and has puzzled many scholars for over forty years. The unorthodox approach presented in this article leads to an arbitrage-free solution which is invariant under currency re-denominations and is symmetric, as…

2018-05-09abs ↗pdf ↗