New RL approach learns dynamic VCG mechanisms in unknown MDP environments.
problem Learning dynamic VCG mechanisms in unknown MDP environments.
method Reward-free online RL for exploration, combined with function approximation.
result Regret bound of O ~ ( T 2 / 3 ) \tilde{\mathcal{O}}(T^{2/3}) O ~ ( T 2/3 ) for dynamic VCG mechanism learning. Algorithm learns optimal dynamic mechanisms from data.
problem Designing optimal mechanisms for dynamic settings with unknown reward functions.
method Offline reinforcement learning with pessimism principle.
result Learned mechanisms are efficient, individually rational, and truthful.
Optimizes e-commerce traffic sales by incorporating hidden costs into auction mechanisms.
problem Hidden costs from unexpected advertising items in search results.
method Dynamic reserve price design with distributed solving algorithm.
result Ensures a balanced relationship between revenue and user experience.
Noether's framework reveals symmetry-breaking in neural networks.
problem Understanding the role of symmetry breaking in neural networks.
method Developed a theoretical framework using Lagrangian mechanics.
result Identified 'kinetic symmetry breaking' and its effect on learning dynamics.
Innovative ball bearing converts rotary to reciprocating motion.
problem Designing efficient motion conversion mechanisms.
method Closed curve envelopment theory and diameter-stroke ratio concept.
result Compact and vibration-reduced ball bearing design.
New mechanism designs regulate herding in financial markets.
problem Herding causes irrational market decisions and volatility.
method A trilateral game framework based on optimal control theory.
result Effective mechanisms improve social welfare.
Proposes a deep generative model for robust forecasting on sparse multivariate time series.
problem Forecasting on sparse multivariate time series with suboptimal results when sparsity is high.
method Dynamic Gaussian Mixture distribution for modeling latent clusters, using neural networks and gating mechanism.
result Demonstrates robust modeling of sparse multivariate time series with improved accuracy.
In this paper, we propose Dynamic Self-Attention (DSA), a new self-attention mechanism for sentence embedding. We design DSA by modifying dynamic routing in capsule network (Sabouretal.,2017) for natural language processing. DSA attends to informative words with a dynamic weight vector. We achieve new state-of-the-art …
A novel incentive mechanism improves fairness and participation in federated learning.
problem Low-quality clients and lack of fairness in federated learning.
method Client selection process and money transfer mechanism to ensure fairness and participation.
result The proposed incentive mechanism improves the duration and fairness of federated learning.
Study develops a smart contract framework for efficient and fair resource allocation.
problem Lack of rigorous economic foundation in decentralized coordination and smart contract implementations.
method Mechanism design framework with provable convergence guarantees for decentralized price adjustment.
result Proves stability and robustness of the proposed mechanism under various perturbations.
Graph neural networks are explained through heat diffusion analogy.
problem Limitations of graph neural networks (oversmoothing, oversquashing).
method Analogizing message passing in GNNs to heat dynamics.
result Fundamental understanding of GNNs and improved model design.
New algorithm learns LQR with O ( T ) O(\sqrt{T}) O ( T ) regret using Langevin dynamics and excitation.
problem Learning LQR with a O ( T ) O(\sqrt{T}) O ( T ) regret bound. method Thompson sampling with Langevin dynamics and excitation mechanism.
result Achieved O ( T ) O(\sqrt{T}) O ( T ) regret bound for LQR learning. Paper connects dynamics of mechanical systems to Reeb dynamics.
problem Understanding dynamics in mechanical systems with Poisson structures.
method Using Jacobi bundle metrics and linear Poisson structures.
result Extends classical results on Reeb dynamics to mechanical systems.
DaringFed incentivizes clients in OFL with dynamic rewards under TII.
problem Designing incentives for OFL clients under dynamic, incomplete information.
method Formulated as a dynamic signaling and pricing allocation problem in a Bayesian persuasion game.
result Optimal design of DaringFed improves accuracy and convergence speed by 16.99%.
Unified approach to denoising Markov models for efficient sampling.
problem Designing efficient sampling algorithms for complex distributions.
method Mathematical foundation using measure transport and nonequilibrium statistical mechanics.
result Unified variational objective and backward generator construction.
Mechanism design for large item sets using topic models.
problem Designing optimal mechanisms for large item sets when exact priors are unknown or intractable.
method Proposes a framework that disentangles statistical estimation and mechanism design, leveraging topic models to reduce complexity.
result Reduces the complexity of mechanism design for large item sets, making it feasible with topic models.
We present a machine learning framework for modeling protein dynamics. Our approach uses L1-regularized, reversible hidden Markov models to understand large protein datasets generated via molecular dynamics simulations. Our model is motivated by three design principles: (1) the requirement of massive scalability; (2) t…
Enhances neural network dynamics to boost computational capacity.
problem Improving computational capacity of neural networks.
method Introducing Phase Transition Adaptation to drive system dynamics towards edge of stability.
result Consistently achieves enhancement in computational capacity over multiple datasets.
New method learns population dynamics from snapshots, outperforming existing models.
problem Capturing periodic and other dynamical properties of population dynamics.
method Wasserstein Lagrangian Mechanics (WLM) for learning second-order dynamics from observed marginals.
result WLM outperforms existing methods across various dynamics, including vortex dynamics, embryonic development, and flocking.
Paper tackles dynamic behavior of variable topology mechanisms, presenting new transition conditions.
problem Dynamic behavior of mechanisms with changing kinematic topology.
method Presented new transition conditions for variable topology mechanisms using projected motion equations and Voronets equations.
result Results show the dynamic behavior of joint locking in 3R and 6DOF mechanisms.
A new mechanism optimizes data marketplace pricing efficiently.
problem Designing fair and efficient pricing mechanisms for data marketplaces.
method Two-stage approach: auctions to estimate value distributions, then optimal posted prices.
result MAPP achieves optimal revenue with minimal price discrimination.
Object-based approaches for learning action-conditioned dynamics has demonstrated promise for generalization and interpretability. However, existing approaches suffer from structural limitations and optimization difficulties for common environments with multiple dynamic objects. In this paper, we present a novel self-s…
SYNC learns time-aware causal representations to improve model generalization in evolving domains.
problem Spurious correlations and shortcut learning in existing EDG methods hinder model generalization.
method SYNC integrates dynamic causal factors and causal mechanism drifts into a sequential VAE framework.
result SYNC achieves superior temporal generalization performance on synthetic and real-world datasets.
Optimizes bidding strategies for LinkedIn ads across multiple platforms.
problem Optimizing automated bidding agents for dynamic online marketplaces.
method Developed a general optimization framework for buyer's interest, agnostic to auction mechanisms.
result Automatically guarantees the optimality of budget allocation across ad units and platforms.
Geometric framework explains and controls implicit bias in machine learning.
problem Understanding and controlling the selection of solutions in overparameterized models.
method Developed a theoretical and constructive framework based on geometric corrections induced by gradient noise and continuous symmetries of the loss.
result Computed the induced bias across various architectures and enabled inverse design to shape the bias.
The paper explores how structured representations influence learning dynamics in neural networks.
problem Understanding the training dynamics of deep neural networks.
method Investigates a family of enriched transformation layers with constrained pathways and adaptive corrections.
result Improved robustness, smoother optimization, and scalable depth behavior are achieved through structured representations.
A new Dirac algebroid approach for nonholonomic systems.
problem Nonholonomic constraints in mechanical systems.
method Developed a Dirac algebroid to generate phase equations for systems with linear nonholonomic constraints.
result Unified approach to describe systems with different potentials.
Despite the phenomenal success of deep learning in recent years, there remains a gap in understanding the fundamental mechanics of neural nets. More research is focussed on handcrafting complex and larger networks, and the design decisions are often ad-hoc and based on intuition. Some recent research has aimed to demys…
This paper proposes an improved design of the perceptron unit to mitigate the vanishing gradient problem. This nuisance appears when training deep multilayer perceptron networks with bounded activation functions. The new neuron design, named auto-rotating perceptron (ARP), has a mechanism to ensure that the node always…
The paper develops an economic foundation for multi-agent learning in markets.
problem Learning dynamics in markets with strategic externalities.
method A two-phase incentive mechanism that estimates and uses implementable transfers to steer long-run dynamics.
result The mechanism achieves sublinear social-welfare regret and asymptotically optimal welfare under mild rationality and exploration conditions.
Deep learning models forecast multiple yield curves with improved accuracy.
problem Globalization of financial markets affects yield curves.
method Combines self-attention mechanism and nonparametric quantile regression.
result Effective point and interval forecasts of future yields.
Studies geometric mechanics for autonomous and nonautonomous systems.
problem Understanding the geometric basis of mechanics.
method Geometric descriptions, Lagrangian, Hamiltonian, unified formalisms, symmetries, variational principles.
result Characterization of dynamical systems' properties and characteristics.
Paper analyzes dynamics of nonholonomic systems with collisions using variational techniques.
problem Analyzing the dynamics of nonholonomic mechanical systems with impacts.
method Variational techniques extended to nonsmooth context for collisions.
result Variational formulation for implicit nonholonomic mechanical systems with energy-momentum preserving collisions.
While model-based deep reinforcement learning (RL) holds great promise for sample efficiency and generalization, learning an accurate dynamics model is often challenging and requires substantial interaction with the environment. A wide variety of domains have dynamics that share common foundations like the laws of clas…
We design two mechanisms for the recommender system to collect user ratings. One is modified Laplace mechanism, and the other is randomized response mechanism. We prove that they are both differentially private and preserve the data utility.
The paper provides a geometric framework for understanding non-equilibrium thermodynamics.
problem Unclear geometric structure of GENERIC in non-equilibrium thermodynamics.
method Cotangent lifts of dynamics, splitting into holonomic and vertical representatives, and formulation within contact geometry.
result Physical meaning and explicit formulation of the second law of thermodynamics within evolution equations.
Paper proposes a framework for token economy simulation and wealth distribution.
problem Simulation and regulation of token economies.
method Formal analysis framework for tokenomics, defining mechanisms for wealth distribution and stability.
result Algorithmic regulatory controls for token economies to achieve desired wealth distribution.
Myopic procedures are shown to be asymptotically optimal in ranking and selection problems.
problem Selecting the best design from a set with unknown mean performance.
method Myopic procedures that iteratively improve an approximation of the objective measure.
result Myopic procedures satisfy optimality conditions of ranking and selection problems.
Electrostatics method samples complex distributions deterministically.
problem Sampling and inference of complex, high-dimensional distributions.
method Electrostatics-based particle system with Newton mechanics principles.
result Method achieves comparable performance to other methods in benchmark tasks.
Enhances LightGCN for credit bond recommendations with dynamic node embeddings.
problem Challenges in static embeddings for rapidly evolving user interests in finance.
method Causal graph convolution for dynamic node embeddings over chronological user-item interactions.
result Significantly enhances LightGCN performance in financial product recommendations.
The paper uses machine learning to compute rare event probabilities in stochastic systems.
problem Characterizing rare events in stochastic dynamical systems with weak noise.
method Developed a neural network framework for computing quasipotential, most probable paths, and prefactors.
result Demonstrated higher effectiveness and accuracy of the algorithm in calculating mean exit times.
Physical modeling of robotic system behavior is the foundation for controlling many robotic mechanisms to a satisfactory degree. Mechanisms are also typically designed in a way that good model accuracy can be achieved with relatively simple models and model identification strategies. If the modeling accuracy using phys…
The numerical integration plays a fundamental role in understanding the behaviour of many mechanical systems. In this paper some important aspects of the mechanical integrators on the dynamics of a mechanical system are studied. More specific, we have shown that if that the Lie-Trotter integrator is obtained, in case o…
TRS-ODENs learn dynamics with time-reversal symmetry for more efficient learning.
problem Learning dynamics with time-reversal symmetry for more efficient learning.
method Proposed a loss function and a new framework (TRS-ODENs) to learn dynamics efficiently.
result TRS-ODENs can learn dynamics from noisy and complex trajectories efficiently.
A novel model-selection method for dynamic networks using synthetic data.
problem Classifying and understanding the growth mechanisms of dynamic networks.
method Training a classifier on synthetic network data generated by nine random graph models, using dynamic features that count new links.
result Achieves near-perfect classification of synthetic networks, outperforming state-of-the-art methods.
Study shows how diverse investors' learning and preferences shape financial markets.
problem Understanding how diverse investor behaviors and preferences affect market dynamics.
method Developed a multi-agent reinforcement learning framework with heterogeneous preferences and learning mechanisms.
result Diverse investors develop differentiated strategies through interaction, leading to realistic market dynamics.
Optimal DP mechanisms for vector queries are found to be staircase distributions.
problem Designing optimal additive mechanisms for vector-valued queries under differential privacy.
method Reduction to radially symmetric distributions and convex rearrangement theory.
result Staircase mechanisms are optimal for any norm and cost function.
The paper tackles robust design selection for online experiments under uncertain interference mechanisms.
problem Designing experiments in ads, recommendations, and member-experience systems when interference mechanisms are unknown.
method Formulates the problem as robust design selection over uncertain exposure mechanisms. Compares designs by worst-case planning risk over an ambiguity set combining various factors.
result Develops a geometry-aware guarantee and robust selector theorem with excess-risk control, exact recovery under separation, and certified shortlists when the risk surface is flat.