New algorithm for maximizing submodular functions in real-time data changes.
problem Maximizing submodular functions under dynamic constraints.
method Randomized algorithm with O(k2) amortized update time. result 4-approximate solution to submodular maximization problem.
This paper introduces new risk measures for evaluating losses with varying time horizons.
problem Capturing horizon risk and cash non-additivity in risk evaluation.
method Uses BSDEs and shortfall approaches to develop h-generalized shortfall risk measures.
result Introduces hq-entropic risk measures as a new family of fully-dynamic risk measures.
Paper introduces robust, dynamic coreset for outlier-resilient learning problems.
problem Dealing with outliers in continuous-and-bounded learning problems.
method Proposes a novel robust coreset method for fully-dynamic environments.
result First robust and fully-dynamic coreset construction method for optimization problems.
New risk measure considers horizon risk and interest rate uncertainty.
problem Dynamic risk evaluation considering horizon risk and interest rate uncertainty.
method Introduced a risk measure based on generalized Tsallis entropy.
result New q-entropic risk measure quantifies capital requirement.
We investigate the general structure of optimal investment and consumption with small proportional transaction costs. For a safe asset and a risky asset with general continuous dynamics, traded with random and time-varying but small transaction costs, we derive simple formal asymptotics for the optimal policy and welfa…
Algorithm achieves comparable performance to fully dynamic data with only a few batches.
problem High-dimensional multi-armed contextual bandits with batched feedback.
method Provable sample-efficient algorithm using batch allocation method.
result Achieves regret bounds comparable to fully sequential setting with only L = O(log T) batches.
The paper analyzes strategic irreversible investments with novel dynamic strategies.
problem Tradeoff between preemption incentives and option value of waiting in oligopolistic markets.
method Developed novel Markov perfect equilibrium to handle singular control of optimal investment.
result Simpler strategies lead to a 'preemption trap' with zero net present values.
The paper defines and implements risk-indifference pricing for American-style contingent claims.
problem Pricing American-style contingent claims under uncertainty.
method Indifference pricing using convex risk measures and stochastic volatility models, with numerical solutions via deep learning.
result Characterization of indifference prices via Backward Stochastic Differential Equations (BSDEs).
Study finds non-monotonic Value of Information in dynamic multi-market monopoly.
problem Investigates non-monotonicity in Value of Information for a price-setting monopolist.
method Uses a Bayesian inverse problem with Kalman-Bucy-Stratonovich filter in a dynamic discrete model.
result Non-monotonic relationship between signal variance and Value of Information.
New framework for consistent submodular maximization with insertions and deletions.
problem Maintaining near-optimal solutions in a dynamic setting with insertions and deletions.
method Developed a general framework for fully dynamic submodular maximization, instantiated for cardinality and rank-k matroid constraints.
result First constant-factor approximations with sublinear consistency for both cardinality and rank-k matroid constraints.
The Hawking energy is nonnegative and rigid on area-constrained surfaces in general relativity.
problem The rigidity and positivity of the Hawking energy on specific surfaces in general relativity.
method Evaluation of the Hawking energy on area-constrained critical surfaces under the dominant energy condition.
result The Hawking energy is nonnegative and rigid on area-constrained surfaces, including charged and cosmological constant variants.
PriceSeer benchmarks LLMs in real-time stock prediction.
problem Evaluating LLMs' stock prediction accuracy and robustness.
method Real-time benchmark with 110 U.S. stocks, internal and external information expansion.
result LLMs perform suboptimally in long-term predictions due to fake news and specific industries.
A new method uses matrix sketches for efficient graph clustering in dynamic environments.
problem Efficiently clustering large, dynamic graphs in distributed memory systems.
method Inspired by spectral clustering, the approach uses random dimension-reducing projections to derive matrix sketches.
result The method produces embeddings that yield performant clustering results in a fully-dynamic stochastic block model stream.
This paper studies recursive ensembles driven by Fibonacci updates, improving learning dynamics.
problem Improving learning dynamics in recursive ensemble learning.
method Develops second-order recursive architectures with Fibonacci-type update flows.
result Establishes global convergence conditions and generalization bounds for recursive ensembles.
Study of phase separation and geometry on a closed elastic curve, including dynamics and free energy minimization.
problem Free energy and dynamics of a closed elastic filament coupled to a scalar concentration field.
method Analytical and numerical simulations of coupled Willmore flow and Cahn--Hilliard gradient flow on differential geometry.
result Qualitative changes in free energy landscape due to closure constraint, leading to metastable and stable multi-domain morphologies.
Probabilistic programs with dynamic computation graphs can define measures over sample spaces with unbounded dimensionality, which constitute programmatic analogues to Bayesian nonparametrics. Owing to the generality of this model class, inference relies on `black-box' Monte Carlo methods that are often not able to tak…
Drawing on recent contributions inferring financial interconnectedness from market data, our paper provides new insights on the evolution of the US financial industry over a long period of time by using several tools coming from network science. Following [1] a Time-Varying Parameter Vector AutoRegressive (TVP-VAR) app…
This paper proposes a new geometric model optimization method.
problem Building adaptive manifold models with dynamic geometry.
method Optimizing metric tensor field on a manifold with variational framework.
result Metric optimization yields models with greater expressive power than fixed geometry models.
AI-Trader benchmarks LLMs in live financial markets, revealing poor trading performance.
problem Challenges in real-time financial decision-making by autonomous agents.
method Fully automated, live evaluation benchmark with minimal human intervention.
result General intelligence does not translate to effective trading, highlighting limitations.