The purpose of this paper relies on the study of long term yield curves modeling. Inspired by the economic litterature, it provides a financial interpretation of the Ramsey rule that links discount rate and marginal utility of aggregate optimal consumption. For such a long maturity modelization, the possibility of adju…
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,657 papers · 148 categories
Trend · papers per month
48 results for “consistent progress”
Gradient span algorithms show consistent progress in high dimensions.
problem Understanding consistent training progress in large machine learning models.
method Proving deterministic behavior of gradient span algorithms on Gaussian random functions.
result Gradient span algorithms have asymptotically deterministic behavior in high dimensions.
We propose Progressive Structure-conditional Generative Adversarial Networks (PSGAN), a new framework that can generate full-body and high-resolution character images based on structural information. Recent progress in generative adversarial networks with progressive training has made it possible to generate high-resol…
The purpose of this paper relies on the study of long term affine yield curves modeling. It is inspired by the Ramsey rule of the economic literature, that links discount rate and marginal utility of aggregate optimal consumption. For such a long maturity modelization, the possibility of adjusting preferences to new ec…
Alzheimer's Disease (AD) is characterized by a cascade of biomarkers becoming abnormal, the pathophysiology of which is very complex and largely unknown. Event-based modeling (EBM) is a data-driven technique to estimate the sequence in which biomarkers for a disease become abnormal based on cross-sectional data. It can…
From Gravity to Confinement: Wealth Redistribution as Optimal Drift Design in the Fokker-Planck Frameworkphysics.soc-ph
Wealth redistribution through Fokker-Planck equation controls preserves Gini coefficient.
problem Preserving Gini coefficient through proportional wealth tax.
method Formulating optimal redistribution as a control problem for Fokker-Planck equation.
result Progressive taxes redistribute within policy-relevant timescales.
Machine learning has made tremendous progress in recent years, with models matching or even surpassing humans on a series of specialized tasks. One key element behind the progress of machine learning in recent years has been the ability to train machine learning models in large-scale distributed shared-memory and messa…
Proposes a progressive label correction method for feature-dependent label noise.
problem Real-world large-scale datasets often suffer from heterogeneous, feature-dependent label noise.
method A progressive label correction algorithm that iteratively refines the model.
result A classifier trained with this strategy converges to be consistent with the Bayes classifier for various noise patterns.
The prescribed Ricci curvature problem consists in finding a Riemannian metric on a manifold such that the Ricci curvature of equals a given -tensor field . We survey the recent progress on this problem in the case where is a homogeneous space.
Improved NODEs for long-term time series forecasting.
problem Dealing with complex, multi-frequency data.
method Progressive learning paradigm with curriculum learning.
result Performance improved by over 64%.
We develop an algorithm for systematic design of a large artificial neural network using a progression property. We find that some non-linear functions, such as the rectifier linear unit and its derivatives, hold the property. The systematic design addresses the choice of network size and regularization of parameters. …
Patient subtyping based on temporal observations can lead to significantly nuanced subtyping that acknowledges the dynamic characteristics of diseases. Existing methods for subtyping trajectories treat the evolution of clinical observations as a homogeneous process or employ data available at regular intervals. In real…
In neural architecture search, the structure of the neural network to best model a given dataset is determined by an automated search process. Efficient Neural Architecture Search (ENAS), proposed by Pham et al. (2018), has recently received considerable attention due to its ability to find excellent architectures with…
The paper simplifies complex jump-diffusion markets to complete models.
problem Pricing and hedging derivatives in incomplete jump-diffusion markets.
method Filtration reduction to a complete market, then consistency to original market.
result A unique equivalent martingale measure is obtained for pricing.
Develops a machine learning model to predict ALS progression and assistive device use.
problem Challenges in predicting clinically meaningful milestones in ALS.
method Integrates longitudinal ALSFRS-R trajectories with survival modeling.
result Generates individualized survival curves and predicts wheelchair-free survival.
LHM integrates expert ODEs with neural ODEs for disease progression prediction.
problem Predicting disease progression under medications using limited data.
method Integrating expert-designed ODEs with machine-learned Neural ODEs.
result LHM consistently outperforms previous methods, especially in small sample regimes.
The book explores essential stats and psychology for quantitative trading.
problem Developing a quantitative trading system.
method Logical progression through articles on statistics, quantitative trading, and psychology.
result Essential elements for quantitative trading systems.
We present a framework for translating unlabeled images from one domain into analog images in another domain. We employ a progressively growing skip-connected encoder-generator structure and train it with a GAN loss for realistic output, a cycle consistency loss for maintaining same-domain translation identity, and a s…
Drop-Muon updates only some layers, speeding up training.
problem Conventional deep learning optimizers update all layers at once, which can be inefficient.
method Drop-Muon updates only a subset of layers per step, with randomized schedules.
result Drop-Muon achieves up to 1.4x faster training time with similar accuracy.
Framework predicts patient risk progression over time.
problem Predicting how patient risk changes over time.
method Supervised contrastive learning framework with embedding properties.
result Framework outperforms baselines in mortality and cognitive impairment datasets.
MaxMatch improves SSL with worst-case consistency for better generalization.
problem Efficiently supervised learning with unlabeled data.
method Worst-case consistency regularization for SSL, providing a bound and an algorithm.
result The proposed method converges to a stationary point and improves generalization.
We explore a new way to evaluate generative models using insights from evaluation of competitive games between human players. We show experimentally that tournaments between generators and discriminators provide an effective way to evaluate generative models. We introduce two methods for summarizing tournament outcomes…
In this article, we investigate when the set of primitive geodesic lengths on a Riemannian manifold have arbitrarily long arithmetic progressions. We prove that in the space of negatively curved metrics, a metric having such arithmetic progressions is quite rare. We introduce almost arithmetic progressions, a coarsific…
The Link Smoothing Gamemath.CO
We introduce a topological combinatorial game called the Link Smoothing Game. The game is played on the shadow of a link diagram and legal moves consist of smoothing precrossings. One player's goal is to keep the diagram connected while the other player's goal is to disconnect the shadow. We make significant progress t…
SAEs struggle with feature consistency across runs, hindering MI reliability.
problem Inconsistency of learned SAE features across different training runs.
method Propose using the Pairwise Dictionary Mean Correlation Coefficient (PW-MCC) to measure feature consistency.
result High levels of feature consistency (0.80 for TopK SAEs on LLM activations) are achievable with appropriate architectural choices.
Determining what experience to generate to best facilitate learning (i.e. exploration) is one of the distinguishing features and open challenges in reinforcement learning. The advent of distributed agents that interact with parallel instances of the environment has enabled larger scales and greater flexibility, but has…
Partial-label learning (PLL) is a typical weakly supervised learning problem, where each training instance is equipped with a set of candidate labels among which only one is the true label. Most existing methods elaborately designed learning objectives as constrained optimizations that must be solved in specific manner…
GraphBench creates a unified benchmark for graph learning tasks.
problem Fragmented benchmarking practices and inconsistent evaluation protocols in graph learning.
method Developed a comprehensive benchmark suite with standardized evaluation protocols.
result Established principled baselines for future research in graph learning.
Boosting-inspired framework for federated learning with progressive model personalization.
problem Statistical heterogeneity across clients in federated learning.
method Construct an ensemble of personalized models, progressively increasing the depth of the personalized component while controlling its effective complexity.
result Consistently outperforms state-of-the-art PFL methods under heterogeneous data distributions.
Consistent partial identification of causal effects proved for neural models.
problem Consistency of neural causal partial identification methods.
method Proving consistency for neural models with continuous and categorical variables, considering architecture design and Lipschitz regularization.
result Proven consistency of partial identification via neural causal models in a general setting.
In this work we develop a theory of hierarchical clustering for graphs. Our modeling assumption is that graphs are sampled from a graphon, which is a powerful and general model for generating graphs and analyzing large networks. Graphons are a far richer class of graph models than stochastic blockmodels, the primary se…
We use GG distributions to optimize LLMs, reducing size and training time.
problem Lack of understanding in the statistical structure of LLMs.
method GG-based initialization, ACT, GCT.
result Smaller, faster models with minimal communication overhead.
PS-KD distills a model's own knowledge to soften hard targets during training.
problem Improving generalization of deep neural networks by softening hard targets.
method Progressive self-knowledge distillation (PS-KD) that progressively distills a model's own knowledge to soften hard targets.
result PS-KD improves accuracy and provides high quality of confidence estimates in terms of calibration and ordinal ranking.
Which factor dominates the industry evolution? A synergy analysis based on China's ICT industryphysics.soc-ph
Industry evolution caused by various reasons, among which technology progress driving industry development has been approved, but with the new trend of industry convergence, inter-industry convergence also plays an increasing important role. This paper plans to probe the industry synergetic evolution mechanism based on…
Longitudinal patient data has the potential to improve clinical risk stratification models for disease. However, chronic diseases that progress slowly over time are often heterogeneous in their clinical presentation. Patients may progress through disease stages at varying rates. This leads to pathophysiological misalig…
Paper introduces a new curriculum generation method for reinforcement learning.
problem Improving reinforcement learning performance and speed through curriculum learning.
method The paper proposes a novel curriculum generation paradigm based on progression and mapping functions.
result Empirical results show the new approach outperforms state-of-the-art algorithms.
We propose a stepsize adaptation scheme for stochastic gradient descent. It operates directly with the loss function and rescales the gradient in order to make fixed predicted progress on the loss. We demonstrate its capabilities by conclusively improving the performance of Adam and Momentum optimizers. The enhanced op…
Lie groups applied to tech progress in economic growth.
problem Understanding the impact of technical progress on economic growth.
method Application of Lie theory and economic modeling.
result Estimation of GDP function for Viet Nam, highlighting tech progress impact.
The paper describes how martingales can be represented after a random time in financial models.
problem Representing martingales after a random event in financial markets.
method Explicit representation of G-local martingales in terms of F-local martingales and parameters of the random time.
result Comprehensive representation of G-local martingales, complementing previous work.
Bayesian model identifies health disparities in disease progression.
problem Health disparities bias disease progression models.
method Interpretable Bayesian model accounting for three disparities.
result Model identifies and corrects for health disparities.
Dematerialization is the reduction in the quantity of materials needed to produce something useful over time. Dematerialization fundamentally derives from ongoing increases in technical performance but it can be counteracted by demand rebound - increases in usage because of increased value (or decreased cost) that also…
CoVAE improves VAEs by reducing training steps and improving quality.
problem Two-stage training overhead and increased sampling times.
method Consistency training of VAEs with progressive latent representations and time-dependent β parameter.
result CoVAE generates high-quality samples in one or few steps.
New algorithm outperforms existing ones by focusing on mastering rate.
problem Low sample efficiency in learning progress-based algorithms.
method Proposes a new algorithm based on mastering rate.
result Significantly outperforms learning progress-based algorithms.
In this article, we prove that every arithmetic locally symmetric orbifold of classical type without Euclidean or compact factors has arbitrarily long arithmetic progressions in its primitive length spectrum. Moreover, we show the stronger property that every primitive length occurs in arbitrarily long arithmetic progr…
The concept of progress has characterized human society from millennia. However, this concept is elusive and too often given for certain. The goal of this paper is to suggest a general definition of human progress that satisfies, whenever possible the conditions of independence, generality, epistemological applicabilit…
Survey of recent progress in Sasakian geometry.
problem Topological properties and existence of Sasakian structures.
method Review of recent research findings.
result Recent progress in Sasakian geometry.
This work designs an active world model learning system with progress-based curiosity.
problem Learning compact world models from visual exploration.
method Constructs a curious agent in a 3D environment, using -Progress as a curiosity signal.
result The -Progress-driven controller outperforms state-of-the-art exploration strategies.
Study uses machine learning and survival analysis to predict CKD progression.
problem Early detection and management of CKD to reduce ESRD risk.
method Combines machine learning and classical statistical models to identify novel CKD progression predictors.
result Deep learning models outperform other methods in predicting CKD progression.